Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold

DOI10.1007/978-3-662-44777-2_31zbMath1423.68337arXiv1304.6666OpenAlexW368558361MaRDI QIDQ2921423

Charilaos Efthymiou

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (5)

Random Instances of Problems in NP – Algorithms and Statistical Physics ⋮ Planting Colourings Silently ⋮ Local convergence of random graph colorings ⋮ On the Potts antiferromagnet on random graphs ⋮ A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold

This page was built for publication: Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold