在包含团和无弦环的网络上的置信传播
Belief propagation on networks with cliques and chordless cycles
AI总结:
本文提出结合置信传播与边不相交模体覆盖的方法,推导出有限大小团和无弦环的精确消息传递表达式,用于研究随机和现实网络上的键渗流,显著改进了传统消息传递方法。
摘要:
众所周知,基于树的理论能够以极高的精度描述无向聚类网络的性质 [S. Melnik, 等, Phys. Rev. E 83, 036112 (2011)]。合理地推测,基于模体的理论将优于基于树的理论;因为额外的邻居相关性被包含在模体结构中。在本文中,我们使用置信传播结合边不相交模体覆盖,研究了随机和现实世界网络上的键渗流。我们推导出了有限大小的团和无弦环的精确消息传递表达式。我们的理论模型与Monte Carlo模拟结果吻合良好,并对传统消息传递提供了简单而实质性的改进,表明该方法适用于研究随机和经验网络的性质。
英文摘要:
It is well known that tree-based theories can describe the properties of undirected clustered networks with extremely accurate results [S. Melnik, \textit{et al}. Phys. Rev. E 83, 036112 (2011)]. It is reasonable to suggest that a motif based theory would be superior to a tree one; since additional neighbour correlations are encapsulated in the motif structure. In this paper we examine bond percolation on random and real world networks using belief propagation in conjunction with edge-disjoint motif covers. We derive exact message passing expressions for cliques and chordless cycles of finite size. Our theoretical model gives good agreement with Monte Carlo simulation and offers a simple, yet substantial improvement on traditional message passing showing that this approach is suitable to study the properties of random and empirical networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。