Statistical limits of correlation detection in trees

no code implementations • 27 Sep 2022 • Luca Ganassali, Laurent Massoulié, Guilhem Semerjian

In this paper we address the problem of testing whether two observed trees $(t, t')$ are sampled either independently or from a joint distribution under which they are correlated.

On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms

no code implementations • 22 Apr 2009 • Federico Ricci-Tersenghi, Guilhem Semerjian

We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models.

Disordered Systems and Neural Networks Statistical Mechanics Discrete Mathematics

Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation

no code implementations • 11 Sep 2007 • Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian

Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs.