Belief propagation for finite networks using a symmetry-breaking source node
Authors:
Preprint
Abstract
Belief Propagation (BP) is an efficient message-passing algorithm widely used for inference in graphical models and for solving various problems in statistical physics. However, BP often yields inaccurate estimates of order parameters and their susceptibilities in finite systems, particularly in sparse networks with few loops. Here, we show for both percolation and Ising models that fixing the state of a single well-connected "source" node to break global symmetry substantially improves inference accuracy and captures finite-size effects across a broad range of networks, especially tree-like ones, at no additional computational cost.Keywords
All Related Versions
- Version 1, 2025-10-22, ArXiv
- Published version: Physical Review Research, 8 (1).
This publication has 32 references indexed in Scilit:
- Deep learning via message passing algorithms based on belief propagationMachine Learning: Science and Technology, 2022
- Shaping the learning landscape in neural networks around wide flat minimaProceedings of the National Academy of Sciences, 2019
- Influencer identification in dynamical complex systemsJournal of Complex Networks, 2019
- Inverse statistical problems: from the inverse Ising problem to data scienceAdvances in Physics, 2017
- Spontaneous Symmetry Breaking in Finite SystemsPhilosophy of Science, 2016
- Statistical physics of inference: thresholds and algorithmsAdvances in Physics, 2016
- Constraint satisfaction problems and neural networks: A statistical physics perspectiveJournal of Physiology-Paris, 2009
- On the properties of the Bethe approximation and loopy belief propagation on binary networksJournal of Statistical Mechanics: Theory and Experiment, 2005
- Monte Carlo Methods in Statistical Physics1999
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986