Bayesian Models for Directed Graphs
有向图的贝叶斯模型
Holland and Leinhardt (1981) proposed a simple exponential model called the p 1 model for analyzing digraphs that arise in studies of networks. A digraph consists of a set of g nodes and a g × g adjacency matrix (Xij ), where Xij = 1 if node i relates to node j and Xij = 0 otherwise. The underlying cell probabilities pij = Pr(Xij = 1) are to be estimated from these dichotomous responses. The p 1 model imposes an additive structure on a log-odds version of the pij . It…