MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
SODA, pp. 305-316, 2014.
algorithmsdesigngraph algorithmsgraph labelingtheory
Sampling from the Gibbs distribution is a well studied problem in computer science as well as in statistical physics. In this work we focus on the k-colouring model and the hard-core model with fugacity λ when the underlying graph is an instance of Erdős-Rényi random graph G(n, p), where p = d/n and d is fixed. We use the Markov Ch...More
PPT (Upload PPT)