Author:
Cantwell George T.,Newman M. E. J.
Abstract
Message passing is a fundamental technique for performing calculations on networks and graphs with applications in physics, computer science, statistics, and machine learning, including Bayesian inference, spin models, satisfiability, graph partitioning, network epidemiology, and the calculation of matrix eigenvalues. Despite its wide use, however, it has long been recognized that the method has a fundamental flaw: It works poorly on networks that contain short loops. Loops introduce correlations that can cause the method to give inaccurate answers or to fail completely in the worst cases. Unfortunately, most real-world networks contain many short loops, which limits the usefulness of the message-passing approach. In this paper we demonstrate how to rectify this shortcoming and create message-passing methods that work on any network. We give 2 example applications, one to the percolation properties of networks and the other to the calculation of the spectra of sparse matrices.
Funder
National Science Foundation
Publisher
Proceedings of the National Academy of Sciences
Reference25 articles.
1. M. Newman , Networks (Oxford University Press, Oxford, UK, ed. 2, 2018).
2. Statistical theory of superlattices;Bethe;Proc. R. Soc. Lond. A,1935
3. J. Pearl , “Reverend Bayes on inference engines: A distributed hierarchical approach” in Proceedings of the 2nd National Conference on Artificial Intelligence (AAAI Press, Palo Alto, CA, 1982), pp. 133–136.
4. M. Mézard , A. Montanari , Information, Physics, and Computation (Oxford University Press, Oxford, UK, 2009).
5. Analytic and Algorithmic Solution of Random Satisfiability Problems
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献