Replica bounds for diluted non-Poissonian spin systems
From MaRDI portal
Publication:5696390
DOI10.1088/0305-4470/36/43/021zbMath1075.82516arXivcond-mat/0307367OpenAlexW2134840900MaRDI QIDQ5696390
Michele Leone, Fabio Lucio Toninelli, Silvio Franz
Publication date: 18 October 2005
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0307367
Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
On the number of circuits in random graphs, The adaptive interpolation method for proving replica formulas. Applications to the Curie–Weiss and Wigner spike models, Strong replica symmetry in high-dimensional optimal Bayesian inference, On the concentration of the number of solutions of random satisfiability formulas, The marginally stable Bethe lattice spin glass revisited, Concentration of multi-overlaps for random dilute ferromagnetic spin models, Improved replica bounds for the independence ratio of random regular graphs, The Interpolation Method for Random Graphs with Prescribed Degrees, Factor models on locally tree-like graphs, Right-convergence of sparse random graphs, DRIVEN TRANSITIONS AT THE ONSET OF ERGODICITY BREAKING IN GAUGE-INVARIANT COMPLEX NETWORKS, Replica bounds by combinatorial interpolation for diluted spin systems, The full replica symmetry breaking in the Ising spin glass on random regular graph, A note on the Guerra and Talagrand theorems for mean field spin glasses: the simple case of spherical models, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, Fluctuations of the free energy in the diluted SK-model, Convergence of maximum bisection ratio of sparse random graphs, The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference, The number of matchings in random graphs, Minimal contagious sets in random regular graphs