Limits of discrete distributions and Gibbs measures on random graphs

DOI10.1016/j.ejc.2017.06.012zbMath1369.05183arXiv1512.06798OpenAlexW2266756552WikidataQ105583619 ScholiaQ105583619MaRDI QIDQ2403690

Kathrin Skubch, Will Perkins, Amin Coja-Oghlan

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph limitsAldous-Hoover representation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)

Related Items (8)

Phase transitions in discrete structures ⋮ Information-theoretic thresholds from the cavity method ⋮ Harnessing the Bethe free energy ⋮ Replica symmetry breaking without replicas ⋮ Bethe states of random factor graphs ⋮ Spin systems on Bethe lattices ⋮ The number of solutions for random regular NAE-SAT ⋮ The Cut Metric for Probability Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spin glass models from the point of view of spin distributions
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Representations for partially exchangeable arrays of random variables
• Poisson approximation for dependent trials
• Factor models on locally tree-like graphs
• Processes on unimodular random networks
• Counting Independent Sets Using the Bethe Approximation
• Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Modern Coding Theory
• On the maximum satisfiability of random formulas
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Graph limits and exchangeable random graphs
• Information, Physics, and Computation
• The Sherrington-Kirkpatrick Model
• Graphons, cut norm and distance, couplings and rearrangements
• Local Convergence of Random Graph Colorings
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

This page was built for publication: Limits of discrete distributions and Gibbs measures on random graphs