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

DOI10.1137/1.9781611973402.22zbMath1421.68190MaRDI 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

05C80: Random graphs (graph-theoretic aspects)

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W20: Randomized algorithms