Many local Markov chains based on Glauber dynamics are known to undergo a phase transition as a parameter λ of the system is varied. For independent sets on the 2-dimensional Cartesian lattice, the Gibbs distribution assigns each independent set a weight λ|I|, and the Markov chain adds or deletes a single vertex at each step. It is believed that there is a critical point λc ≈ 3.79 such that for λ < λc, local dynamics converge in polynomial time while for λ> λc they require exponential time. We introduce a new method for showing slow mixing based on the presence or absence of certain topological obstructions in the independent sets. Using elementary arguments, we show that Glauber dynamics will be slow for sampling independent sets in ...
Copyright © 2019 by SIAM. A well-known conjecture in computer science and statistical physics is tha...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
This is a preprint of an article published in the journal Random Structures & Algorithms, 18(2), 101...
The even discrete torus is the graph TL,d on vertex set {0,..., L − 1}d (with L even) in which two v...
The six-vertex model in statistical physics is a weighted generalization of the ice model on Z^2 (i....
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangula...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
Algorithms based on Markov chains are ubiquitous across scientific disciplines, as they provide a me...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
In this paper, the Glauber dynamics for the Ising model on the complete multipartite graph $K_{np_1,...
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations...
A new method for analyzing the mixing time of Markov chains is described. This method is an extensio...
We prove that the mixing time of the Glauber dynamics for random k-colorings of the complete tree wi...
We study the stochastic Ising model on finite graphs with n vertices and bounded degree and analyze ...
We consider Glauber dynamics for the Ising model on the complete graph on n vertices, known as the C...
Copyright © 2019 by SIAM. A well-known conjecture in computer science and statistical physics is tha...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
This is a preprint of an article published in the journal Random Structures & Algorithms, 18(2), 101...
The even discrete torus is the graph TL,d on vertex set {0,..., L − 1}d (with L even) in which two v...
The six-vertex model in statistical physics is a weighted generalization of the ice model on Z^2 (i....
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangula...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
Algorithms based on Markov chains are ubiquitous across scientific disciplines, as they provide a me...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
In this paper, the Glauber dynamics for the Ising model on the complete multipartite graph $K_{np_1,...
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations...
A new method for analyzing the mixing time of Markov chains is described. This method is an extensio...
We prove that the mixing time of the Glauber dynamics for random k-colorings of the complete tree wi...
We study the stochastic Ising model on finite graphs with n vertices and bounded degree and analyze ...
We consider Glauber dynamics for the Ising model on the complete graph on n vertices, known as the C...
Copyright © 2019 by SIAM. A well-known conjecture in computer science and statistical physics is tha...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
This is a preprint of an article published in the journal Random Structures & Algorithms, 18(2), 101...