Gibbs measures and phase transitions on sparse random graphs
DOI10.1214/09-BJPS027zbMath1205.05209arXiv0910.5460OpenAlexW2963994072MaRDI QIDQ985984
Publication date: 9 August 2010
Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.5460
phase transitionsspin modelsrandom graphsIsing modelGibbs measuressparse graphslocal weak convergence
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) Phase transitions (general) in equilibrium statistical mechanics (82B26) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstruction of random colourings
- Reconstruction on trees and spin glass transition
- Rigorous inequalities between length and time scales in glassy systems
- Finite size scaling for the core of large random hypergraphs
- Ising models on locally tree-like graphs
- The high temperature region of the Viana-Bray diluted spin glass model
- On the hardness of sampling independent sets beyond the tree threshold
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Gibbs measures and phase transitions
- Information flow on trees
- On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
- Glauber dynamics on trees: Boundary conditions and mixing time
- Glauber dynamics on trees and hyperbolic graphs
- Broadcasting on trees and the Ising model.
- Sudden emergence of a giant \(k\)-core in a random graph
- Existence of a phase-transition in a one-dimensional Ising ferromagnet
- The Canophy graph and level statistics for random operators on trees
- Coloring Random Graphs
- Optimal phylogenetic reconstruction
- Network delay inference from additive metrics
- Reconstruction and Clustering in Random Constraint Satisfaction Problems
- Reconstruction for Colorings on Trees
- Modern Coding Theory
- Information, Physics, and Computation
- Percolation
- Sharp thresholds of graph properties, and the $k$-sat problem
- Séminaire de Probabilités XXXVI
- Mixing in time and space for lattice spin systems: A combinatorial view
- Gibbs states and the set of solutions of random constraint satisfaction problems
- On the solution-space geometry of random constraint satisfaction problems
- The two possible values of the chromatic number of a random graph