How to Compute Loop Corrections to Bethe Approximation

We use the Bethe approximation to calculate the critical temperature for the transition from a paramagnetic to a glassy phase in spin-glass models on real-world graphs. Our criterion is based on the marginal stability of the minimum of the Bethe free energy. For uniform degree random graphs (equivalent to the Viana-Bray model) our numerical results, obtained by averaging single problem instances, are in agreement with the known critical temperature obtained by use of the repl...

We present a large deviations theory of the spin-spin correlation functions in the Random Field Ising Model on the Bethe lattice, both at finite and zero temperature. Rare events of atypically correlated variables are particularly important at the critical point: the phase transition is driven by few pairs of strongly correlated spins, while the majority remains basically uncorrelated. At the zero temperature critical point the number of spin pairs correlated over a distance ...

So far the problem of a spin glass on a Bethe lattice has been solved only at the replica symmetric level, which is wrong in the spin glass phase. Because of some technical difficulties, attempts at deriving a replica symmetry breaking solution have been confined to some perturbative regimes, high connectivity lattices or temperature close to the critical temperature. Using the cavity method, we propose a general non perturbative solution of the Bethe lattice spin glass pro...

We discuss the finite-size scaling of the ferromagnetic Ising model on random regular graphs. These graphs are locally tree-like, and in the limit of large graphs, the Bethe approximation gives the exact free energy per site. In the thermodynamic limit, the Ising model on these graphs show a phase transition. This transition is rounded off for finite graphs. We verify the scaling theory prediction that this rounding off is described in terms of the scaling variable $[T/T_c -1...

The Glauber dynamics of disordered spin models with multi-spin interactions on sparse random graphs (Bethe lattices) is investigated. Such models undergo a dynamical glass transition upon decreasing the temperature or increasing the degree of constrainedness. Our analysis is based upon a detailed study of large scale rearrangements which control the slow dynamics of the system close to the dynamical transition. Particular attention is devoted to the neighborhood of a zero tem...

In this work a short overview of the development of spin glass theories, mainly long and short range Ising models, are presented.

We consider the Gaussian random field Ising model (RFIM) on the Bethe lattice at zero temperature in the presence of a uniform external field and derive the exact expressions of the two-point spin-spin and spin-random field correlation functions along the saturation hysteresis loop. To complete the analytical description and suggest possible approximations for the RFIM on Euclidian lattices we also compute the corresponding direct correlation functions (or proper vertices) an...

An exact expression for the spin-spin correlation function is derived for the zero-temperature random-field Ising model defined on a Bethe lattice of arbitrary coordination number. The correlation length describing dynamic spin-spin correlations and separated from the intrinsic topological length scale of the Bethe lattice is shown to diverge as a power law at the critical point. The critical exponents governing the behaviour of the correlation length are consistent with the ...

We discuss the utility of analytical and numerical investigation of spin models, in particular spin glasses, on ordinary ``thin'' random graphs (in effect Feynman diagrams) using methods borrowed from the ``fat'' graphs of two dimensional gravity. We highlight the similarity with Bethe lattice calculations and the advantages of the thin graph approach both analytically and numerically for investigating mean field results.

Belief propagation -- a powerful heuristic method to solve inference problems involving a large number of random variables -- was recently generalized to quantum theory. Like its classical counterpart, this algorithm is exact on trees when the appropriate independence conditions are met and is expected to provide reliable approximations when operated on loopy graphs. In this paper, we benchmark the performances of loopy quantum belief propagation (QBP) in the context of finit...