arXiv Analytics

Sign in

arXiv:cond-mat/0506164AbstractReferencesReviewsResources

The cavity method for large deviations

Olivier Rivoire

Published 2005-06-07Version 1

A method is introduced for studying large deviations in the context of statistical physics of disordered systems. The approach, based on an extension of the cavity method to atypical realizations of the quenched disorder, allows us to compute exponentially small probabilities (rate functions) over different classes of random graphs. It is illustrated with two combinatorial optimization problems, the vertex-cover and coloring problems, for which the presence of replica symmetry breaking phases is taken into account. Applications include the analysis of models on adaptive graph structures.

Related articles: Most relevant | Search more
arXiv:cond-mat/0607290 (Published 2006-07-11, updated 2006-07-17)
A rigorous proof of the cavity method for counting matchings
arXiv:1810.10589 [cond-mat.dis-nn] (Published 2018-10-24)
Statistical mechanics of bipartite $z$-matchings
arXiv:1309.6925 [cond-mat.dis-nn] (Published 2013-09-26)
Typical behavior of the linear programming method for combinatorial optimization problems: From a statistical-mechanical perspective