Sampling Random Colorings of Sparse Random Graphs

zbMath1403.05134arXiv1707.03796MaRDI QIDQ4608004

Daniel Štefanković, Charilaos Efthymiou, Eric Vigoda, Thomas P. Hayes

Publication date: 15 March 2018

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

zbMATH Keywords

Glauber dynamicsblock dynamics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (8)

A Spectral Independence View on Hard Spheres via Block Dynamics ⋮ Counting Solutions to Random CNF Formulas ⋮ Unnamed Item ⋮ On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs ⋮ Uniqueness for the 3-state antiferromagnetic Potts model on the tree ⋮ Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs ⋮ The Glauber dynamics for edge‐colorings of trees ⋮ Deterministic counting of graph colourings using sequences of subgraphs

This page was built for publication: Sampling Random Colorings of Sparse Random Graphs