2000 character limit reached
The cavity method: from exact solutions to algorithms
Published 23 Sep 2022 in cond-mat.dis-nn, cs.DM, and math.PR | (2209.11499v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.