Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
The Swendsen-Wang process does not always mix rapidly
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient exact sampling from the Ising model using Swendsen-Wang
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Decomposition Methods and Sampling Circuits in the Cartesian Lattice
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
Probability in the Engineering and Informational Sciences
Slow mixing of Glauber dynamics for the hard-core model on the hypercube
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Torpid mixing of simulated tempering on the Potts model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Slow mixing of glauber dynamics via topological obstructions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs
Random Structures & Algorithms
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
Torpid mixing of local Markov chains on 3-colorings of the discrete torus
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Uncovering transcriptional regulatory networks by sparse Bayesian factor model
EURASIP Journal on Advances in Signal Processing - Special issue on genomic signal processing
Clustering in interfering binary mixtures
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Journal of Combinatorial Theory Series B
Approximating the partition function of the ferromagnetic Potts model
Journal of the ACM (JACM)
Delay performance in random-access grid networks
Performance Evaluation
| Hi-index | 0.01 |
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice Zd. We prove that under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in Ld-1. In other words, under these circumstances, the mixing in these widely used algorithms is not rapid; instead, it is torpid.The models we study are the independent set model and the q-state Potts model. For both models, we prove that Glauber dynamics is torpid in the region with phase coexistence. For the Potts model, we prove that Swendsen-Wang is torpid at the phase transition point.