Phase transitions in discrete structures

DOI10.4171/176-1/28zbMath1403.82009OpenAlexW4230535748MaRDI QIDQ1620869

Amin Coja-Oghlan

Publication date: 14 November 2018

Full work available at URL: https://doi.org/10.4171/176-1/28

zbMATH Keywords

phase transitionrandom graphdisordered system

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Phase transitions (general) in equilibrium statistical mechanics (82B26)

Related Items (1)

Charting the replica symmetric phase

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper-bounding the \(k\)-colorability threshold by counting covers
• The asymptotic \(k\)-SAT threshold
• On the hardness of sampling independent sets beyond the tree threshold
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• A note on the sharp concentration of the chromatic number of random graphs
• The concentration of the chromatic number of random graphs
• Uniqueness of uniform random colorings of regular trees
• Information-theoretic thresholds from the cavity method
• Bounds for diluted mean-fields spin glass models
• Replica bounds for optimization problems and diluted spin systems
• Limits of discrete distributions and Gibbs measures on random graphs
• Maximum independent sets on random regular graphs
• Factor models on locally tree-like graphs
• Proof of the Satisfiability Conjecture for Large k
• Harnessing the Bethe free energy
• Asymptotic enumeration and limit laws of planar graphs
• Reconstruction and Clustering in Random Constraint Satisfaction Problems
• Graph Theory and Probability
• Percolation
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Modern Coding Theory
• Information, Physics, and Computation
• Approximating the unsatisfiability threshold of random formulas
• Sharp thresholds of graph properties, and the $k$-sat problem
• Almost all regular graphs are hamiltonian
• Random Geometric Graphs
• The Chromatic Number of Random Graphs for Most Average Degrees
• The condensation phase transition in the regular $k$-SAT model
• The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
• The Sherrington-Kirkpatrick Model
• A threshold for unsatisfiability
• Satisfiability threshold for random regular NAE-SAT
• Local Convergence of Random Graph Colorings
• Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees
• 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
• A Combinatorial Classic — Sparse Graphs with High Chromatic Number
• Threshold values of random K‐SAT from the cavity method
• Random Graphs
• Some remarks on the theory of graphs
• The chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph
• The condensation phase transition in random graph coloring

This page was built for publication: Phase transitions in discrete structures