Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold-Reference-Cited by-同舟云学术

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

Published:2014 Issue: Volume: Page:371-381
ISSN:0302-9743
Container-title:Algorithms - ESA 2014
language:
Short-container-title:

Author:

Efthymiou Charilaos

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-44777-2_31

Reference14 articles.

1. Achlioptas, D., Coja-Oghlan, A.: Algorithmic Barriers from Phase Transitions. In: Proc. of FOCS 2008, pp. 793–802 (2008)

2. Aldous, D.: Random walks of finite groups and rapidly mixing Markov chains. In: Séminaire de Probabilités XVII 1981/82, pp. 243–297. Springer, Heidelberg (1983)

3. van den Berg, J., Maes, C.: Disagreement percolation in the study of Markov fields. Annals of Probability 22, 749–763 (1994)

4. Dyer, M., Flaxman, A., Frieze, A.M., Vigoda, E.: Random colouring sparse random graphs with fewer colours than the maximum degree. Journal R.S.A. 29, 450–465 (2006)

5. Dyer, M., Frieze, A.M., Hayes, A., Vigoda, E.: Randomly colouring constant degree graphs. In: Proc. of 45th FOCS, pp. 582–589 (2004)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Local Convergence of Random Graph Colorings;Combinatorica;2017-06-13

2. Planting Colourings Silently;Combinatorics, Probability and Computing;2016-12-07

3. A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold;SIAM Journal on Computing;2016-01

4. Random Instances of Problems in NP – Algorithms and Statistical Physics;Algorithms, Probability, Networks, and Games;2015