We study the stochastic Ising model on finite graphs with n vertices and bounded degree and analyze the effect of boundary conditions on the mixing time. We show that for all low enough temperatures, the spectral gap of the dynamics with (+)-boundary condition on a class of nonamenable graphs, is strictly positive uniformly in n. This implies that the mixing time grows at most linearly in n. The class of graphs we consider includes hyperbolic graphs with sufficiently high degree, where the best upper bound on the mixing time of the free boundary dynamics is polynomial in n, with exponent growing with the inverse temperature. In addition, we construct a graph in this class, for which the mixing time in the free boundary case is exponentially...
We considerably improve upon the recent result of [34] on the mixing time of Glauber dynamics for th...
We consider the Glauber dynamics for the 2D Ising model in a box of side L, at inverse temperature ...
We study Glauber dynamics for the Ising model on the complete graph on n vertices, known as the Curi...
We study a continuous time Glauber dynamics reversible with respect to the Ising model on hyperbolic...
We study a continuous time Glauber dynamics reversible with respect to the Ising model on hyperbolic...
We give the first comprehensive analysis of the effect of boundary conditions on the mixing time of...
In this paper, the Glauber dynamics for the Ising model on the complete multipartite graph $K_{np_1,...
In this thesis we study the mixing times of Markov chains, e.g., therate of convergence of Markov ch...
We consider Glauber dynamics for the Ising model on the complete graph on n vertices, known as the C...
A new method for analyzing the mixing time of Markov chains is described. This method is an extensio...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
We considerably improve upon the recent result of [37] on the mixing time of Glauber dynamics for th...
Motivated by the ‘subgraphs world ’ view of the ferromagnetic Ising model, we analyse the mixing tim...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
We considerably improve upon the recent result of [34] on the mixing time of Glauber dynamics for th...
We consider the Glauber dynamics for the 2D Ising model in a box of side L, at inverse temperature ...
We study Glauber dynamics for the Ising model on the complete graph on n vertices, known as the Curi...
We study a continuous time Glauber dynamics reversible with respect to the Ising model on hyperbolic...
We study a continuous time Glauber dynamics reversible with respect to the Ising model on hyperbolic...
We give the first comprehensive analysis of the effect of boundary conditions on the mixing time of...
In this paper, the Glauber dynamics for the Ising model on the complete multipartite graph $K_{np_1,...
In this thesis we study the mixing times of Markov chains, e.g., therate of convergence of Markov ch...
We consider Glauber dynamics for the Ising model on the complete graph on n vertices, known as the C...
A new method for analyzing the mixing time of Markov chains is described. This method is an extensio...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
We considerably improve upon the recent result of [37] on the mixing time of Glauber dynamics for th...
Motivated by the ‘subgraphs world ’ view of the ferromagnetic Ising model, we analyse the mixing tim...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this a...
We considerably improve upon the recent result of [34] on the mixing time of Glauber dynamics for th...
We consider the Glauber dynamics for the 2D Ising model in a box of side L, at inverse temperature ...
We study Glauber dynamics for the Ising model on the complete graph on n vertices, known as the Curi...