arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.08124cond-mat.dis-nncond-mat.stat-mech
收藏

有圈稀疏随机图的构造方法

Replica methods for loopy sparse random graphs

A C C Coolen

摘要:

我报告的发展,一种新的统计机械形式主义的随机图与许多短循环的分析,并在这样的图形过程。通过最大熵集成,其中的度(通过硬约束)和邻接矩阵谱(通过软约束)规定的图形定义。图上的求和可以通过分析来完成,使用具有复杂副本维度的副本形式主义。所有已知的结果树状图恢复在一个适当的限制。对于循环图,新兴的理论有一个吸引人的和直观的结构,建议如何消息传递算法应适应,以及什么是理论的结构描述自旋系统循环架构。但是,形式主义在很大程度上还没有得到检验,可能需要进一步调整和细化。

英文摘要:

I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑