Bayesian Models for Directed Graphs
有向图的贝叶斯模型AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究有向网络的邻接矩阵、节点关系形成能力及关系互惠。
有向图的贝叶斯模型AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
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 provides information about the abilities of an individual node to attract and to produce relational ties, as well as the tendency of a pair of nodes to reciprocate ties. For digraphs of realistic sizes, the maximum likelihood estimates (MLE's) of the p 1 exponential parameters are often unsatisfactory, particularly when some of the row and column marginal totals of the adjacency matrix are small. A Bayesian approach, using an exchangeable normal prior on the parameters representing the attractiveness and expansiveness characteristics of the nodes, is proposed. The Bayesian p 1 model explicitly recognizes the association between these two characteristics of a node, an important feature ignored by its fixed effects counterpart. An algorithm for finding the MLE's of the covariance components based on a marginal likelihood is presented. An approximate posterior estimation procedure for the exponential parameters is proposed. Using an empirical example, it is shown that the Bayesian p 1 model can yield answers quite different from those of the fixed effects model.