The Interpolation Method for Random Graphs with Prescribed Degrees

DOI10.1017/S0963548315000139zbMath1372.05204arXiv1404.6647MaRDI QIDQ5366899

Justin Salez

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6647

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Vertex degrees (05C07)

Related Items (max. 100)

The adaptive interpolation method for proving replica formulas. Applications to the Curie–Weiss and Wigner spike models ⋮ Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree ⋮ Concentration of multi-overlaps for random dilute ferromagnetic spin models ⋮ Edge ideals of Erdős-Rényi random graphs: linear resolution, unmixedness and regularity ⋮ Replica bounds by combinatorial interpolation for diluted spin systems ⋮ Central limit theorem for statistics of subcritical configuration models ⋮ Convergence of maximum bisection ratio of sparse random graphs ⋮ Limit theory of combinatorial optimization for random geometric graphs ⋮ Typicality and entropy of processes on infinite trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Right-convergence of sparse random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The thermodynamic limit in mean field spin glass models
• Replica bounds for optimization problems and diluted spin systems
• Maximum independent sets on random regular graphs
• Critical behavior in inhomogeneous random graphs
• The Probability That a Random Multigraph is Simple
• The Sherrington-Kirkpatrick Model
• Left and right convergence of graphs with bounded degree
• Sparse graphs: Metrics and random models
• The probability that a random multigraph is simple. II
• The phase transition in inhomogeneous random graphs
• Convergent sequences of sparse graphs: A large deviations approach
• Replica bounds for diluted non-Poissonian spin systems
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
• Mean Field Models for Spin Glasses
• Optimal Transport

This page was built for publication: The Interpolation Method for Random Graphs with Prescribed Degrees