arXiv:2209.11499 Abstract | arXiv Analytics

arXiv:2209.11499 [cond-mat.dis-nn]Abstract References Reviews Resources

The cavity method: from exact solutions to algorithms

Published 2022-09-23Version 1

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.

Comments: To appear as a contribution to the edited volume "Spin Glass Theory & Far Beyond - Replica Symmetry Breaking after 40 Years", World Scientific

Categories: cond-mat.dis-nn, cs.DM, math.PR

Keywords: cavity method, exact solutions, algorithms, random constraint satisfaction problems, phase transitions

Related articles: Most relevant | Search more

arXiv:1911.09377 [cond-mat.dis-nn] (Published 2019-11-21)

The asymptotics of the clustering transition for random constraint satisfaction problems

Louise Budzynski, Guilhem Semerjian

arXiv:1811.01680 [cond-mat.dis-nn] (Published 2018-11-05)

Biased landscapes for random Constraint Satisfaction Problems

Louise Budzynski, Federico Ricci-Tersenghi, Guilhem Semerjian

arXiv:cond-mat/0312046 (Published 2003-12-01, updated 2004-04-30)

O(N) algorithms for disordered systems

Vincent E. Sacksteder