Charting the replica symmetric phase
From MaRDI portal
Publication:1749356
DOI10.1007/s00220-018-3096-xzbMath1395.82039OpenAlexW2605280783MaRDI QIDQ1749356
Mihyun Kang, Nor Jaafari, Tobias Kapetanopoulos, Amin Coja-Oghlan, Charilaos Efthymiou
Publication date: 16 May 2018
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7589/
Classical equilibrium statistical mechanics (general) (82B05) Symmetry breaking in quantum theory (81R40) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Strong replica symmetry in high-dimensional optimal Bayesian inference, Algorithmic obstructions in the random number partitioning problem, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, Metastability of the Potts ferromagnet on random regular graphs, Random-link matching problems on random regular graphs, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, The satisfiability threshold for random linear equations, Spin systems on Bethe lattices, Unnamed Item, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, The replica symmetric phase of random constraint satisfaction problems, Belief propagation on the random \(k\)-SAT model, The Ising Antiferromagnet and Max Cut on Random Regular Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure of finite-RSB asymptotic Gibbs measures in the diluted spin glass models
- Decay of correlations for the hardcore model on the \(d\)-regular random graph
- A positive temperature phase transition in random hypergraph 2-coloring
- The phase transition in random regular exact cover
- Antiferromagnetic Potts model on the Erdős-Rényi random graph
- Reconstruction and estimation in the planted partition model
- Reconstruction for the Potts model
- On the Potts antiferromagnet on random graphs
- Reconstruction on trees and spin glass transition
- The high temperature region of the Viana-Bray diluted spin glass model
- Component structure in the evolution of random hypergraphs
- Information-theoretic thresholds from the cavity method
- A proof of the block model threshold conjecture
- Bounds for diluted mean-fields spin glass models
- On the chromatic number of a random hypergraph
- On the number of solutions in random hypergraph 2-colouring
- Phase Transitions in Discrete Structures
- Proof of the Satisfiability Conjecture for Large k
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Harnessing the Bethe free energy
- Spatial Coupling as a Proof Technique and Three Applications
- Reconstruction and Clustering in Random Constraint Satisfaction Problems
- The Number of Satisfying Assignments of Random Regulark-SAT Formulas
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- Modern Coding Theory
- Relations between average case complexity and approximation complexity
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Information, Physics, and Computation
- Almost all cubic graphs are Hamiltonian
- On the 2-colorability of random hypergraphs
- Community Detection and Stochastic Block Models
- Bounds for Random Constraint Satisfaction Problems via Spatial Coupling
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Community detection thresholds and the weak Ramanujan property
- Planting Colourings Silently
- Gibbs states and the set of solutions of random constraint satisfaction problems
- The freezing threshold for k-colourings of a random graph
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- The two possible values of the chromatic number of a random graph
- Satisfiability threshold for random regular \textsc{nae-sat}
- The condensation phase transition in random graph coloring