MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold

DOI10.1137/1.9781611973402.22zbMath1421.68190OpenAlexW3143901626MaRDI QIDQ5383981

Charilaos Efthymiou

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.22

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20)

Related Items (5)

Spatial mixing and the connective constant: optimal bounds ⋮ A Spectral Independence View on Hard Spheres via Block Dynamics ⋮ On the Potts antiferromagnet on random graphs ⋮ A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold ⋮ Unnamed Item

This page was built for publication: MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold