Partition function expansion on region graphs and message-passing equations

被引:12
|
作者
Zhou, Haijun [1 ]
Wang, Chuang [1 ]
Xiao, Jing-Qing [1 ,2 ]
Bi, Zedong [1 ]
机构
[1] Chinese Acad Sci, State Key Lab Theoret Phys, Inst Theoret Phys, Beijing 100190, Peoples R China
[2] Chinese Acad Sci, Inst Appl Math, Acad Math & Syst Sci, Beijing 100190, Peoples R China
关键词
rigorous results in statistical mechanics; cavity and replica method; spin glasses (theory); message-passing algorithms; STATES;
D O I
10.1088/1742-5468/2011/12/L12001
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods. But finite-dimensional 'real' systems remain very challenging because of the abundance of short loops and strong local correlations. A statistical mechanics theory is constructed in this paper for finite-dimensional models based on the mathematical framework of the partition function expansion and the concept of region graphs. Rigorous expressions for the free energy and grand free energy are derived. Message-passing equations on the region graph, such as belief propagation and survey propagation, are also derived rigorously.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Optimality of Message-Passing Architectures for Sparse Graphs
    Baranwal, Aseem
    Fountoulakis, Kimon
    Jagannath, Aukosh
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [2] Partition function loop series for a general graphical model: free-energy corrections and message-passing equations
    Xiao, Jing-Qing
    Zhou, Haijun
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2011, 44 (42)
  • [3] Executing scheduled task graphs on message-passing architectures
    Yang, T
    Gerasoulis, A
    [J]. INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1996, 8 (03): : 271 - 294
  • [4] OPTIMAL AVERAGE MESSAGE-PASSING DENSITY IN MOORE GRAPHS
    NANAVATI, AA
    IYENGAR, SS
    [J]. APPLIED MATHEMATICS LETTERS, 1994, 7 (05) : 67 - 70
  • [5] Partitioning graphs on message-passing machines by pairwise mincut
    Sadayappan, P
    Ercal, F
    Ramanujam, J
    [J]. INFORMATION SCIENCES, 1998, 111 (1-4) : 223 - 237
  • [6] Dynamic message-passing equations for models with unidirectional dynamics
    Lokhov, Andrey Y.
    Mezard, Marc
    Zdeborova, Lenka
    [J]. PHYSICAL REVIEW E, 2015, 91 (01)
  • [7] SOLVING SYSTEMS OF NONLINEAR EQUATIONS ON A MESSAGE-PASSING MULTIPROCESSOR
    COLEMAN, TF
    LI, GG
    [J]. SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (06): : 1116 - 1135
  • [8] Message-passing for inference and optimization of real variables on sparse graphs
    Wong, K. Y. Michael
    Yeung, C. H.
    Saad, David
    [J]. NEURAL INFORMATION PROCESSING, PT 2, PROCEEDINGS, 2006, 4233 : 754 - 763
  • [9] The logic of message-passing
    Cockett, J. R. B.
    Pastro, Craig
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2009, 74 (08) : 498 - 533
  • [10] The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
    Altarelli, Fabrizio
    Braunstein, Alfredo
    Dall'Asta, Luca
    De Bacco, Caterina
    Franz, Silvio
    [J]. PLOS ONE, 2015, 10 (12):