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

G. R. Grimmett and C. J. H. McDiarmid. On colouring random graphs

1975

Earlier work this paper cites.

F. Kelly. Stochastic models of computer communication systems

1985

Earlier work this paper cites.

J. van den Berg and C. Maes. Disagreement percolation in the study of Markov fields

1994

Earlier work this paper cites.

M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method:an approach to approximate counting and integration

1996

Earlier work this paper cites.

B. G. Pittel, J. Spencer and N. C .Wormald. Sudden emergence of a giant k k -core in a random graph

1996

Earlier work this paper cites.

R. Bubley and M. Dyer. Path Coupling: a Technique for Proving Rapid Mixing in Markov Chains

1997

Earlier work this paper cites.

M. Dyer, A. M. Frieze and M. Jerrum. On counting independent sets in sparse graphs

1999

Earlier work this paper cites.

E. Vigoda. Improved bounds for sampling colorings

1999

Earlier work this paper cites.

M. Dyer, C. S. Greenhill. On Markov chains for independent sets

2000

Earlier work this paper cites.

S. Janson, T. Luczak and A. Rucinski. Random graphs

2000

Earlier work this paper cites.

E. Vigoda. A note on the glauber dynamics for sampling independent sets

2001

Cited alongside, same era.

M. Jerrum. Counting, Sampling and Integrating: Algorithms and Complexity,

2003

Cited alongside, same era.

D. Achlioptas, and A. Naor. The two possible values of the chromatic number of a random graph

2004

Cited alongside, same era.

M. Dyer, A. M. Frieze, A. Hayes, E. Vigoda. Randomly colouring constant degree graphs

2004

Cited alongside, same era.

F. Martinelli, A. Sinclair and D. Weitz. Fast mixing for independent sets, colorings and other models on trees. In proc. of 15th SODA, pp 456-465, 2004

2004

Cited alongside, same era.

M. Molloy. The Glauber dynamics on the colourings of a graph with large girth and maximum degree

D. Weitz. Counting independent sets up to the tree threshold

2006

Later among the works it cites.

A. Frieze and E. Vigoda. A Survey on the use of Markov Chains to Randomly Sample Colorings

2007

Later among the works it cites.

T. Hayes, J. Vera and E. Vigoda. Randomly coloring planar graphs with fewer colors than the maximum degree

2007

Later among the works it cites.

F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, L. Zdeborova. Gibbs states and the set of solutions of random constraint satisfaction problems

2007

Later among the works it cites.

D. Levin, Y. Peres and E. Wilmer. Markov Chains and Mixing Times

2008

Later among the works it cites.

E. Mossel and A. Sly. Gibbs Rapidly Samples Colorings of G n , d / n G_{n,d/n}