Search arXivSearch

arXiv · 0712.0489

Glauber dynamics on nonamenable graphs: Boundary conditions and mixing time

Abstract

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 large in n. This provides a first example where the mixing time jumps from exponential to linear in n while passing from free to (+)-boundary condition. These results extend the analysis of Martinelli, Sinclair and Weitz to a wider class of nonamenable graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandra Bianchi. 2008-11-10. Glauber dynamics on nonamenable graphs: Boundary conditions and mixing time. https://arxiv.org/abs/0712.0489

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR