The cavity method: from exact solutions to algorithms
Disordered Systems and Neural Networks
2022-09-26 v1 Discrete Mathematics
Probability
Abstract
The goal of this chapter is to review the main ideas that underlie the cavity method for disordered models defined on random graphs, as well as present some of its outcomes, focusing on the random constraint satisfaction problems for which it provided both a better understanding of the phase transitions they undergo, and suggestions for the development of algorithms to solve them.
Keywords
Cite
@article{arxiv.2209.11499,
title = {The cavity method: from exact solutions to algorithms},
author = {Alfredo Braunstein and Guilhem Semerjian},
journal= {arXiv preprint arXiv:2209.11499},
year = {2022}
}
Comments
To appear as a contribution to the edited volume "Spin Glass Theory & Far Beyond - Replica Symmetry Breaking after 40 Years", World Scientific