Search arXivSearch

arXiv · 1807.08722

Random-cluster dynamics in $\mathbb Z^2$: rapid mixing with general boundary conditions

Abstract

The random-cluster model with parameters $(p,q)$ is a random graph model that generalizes bond percolation ($q=1$) and the Ising and Potts models ($q\geq 2$). We study its Glauber dynamics on $n\times n$ boxes $Λ_{n}$ of the integer lattice graph $\mathbb Z^2$, where the model exhibits a sharp phase transition at $p=p_c(q)$. Unlike traditional spin systems like the Ising and Potts models, the random-cluster model has non-local interactions. Long-range interactions can be imposed as external connections in the boundary of $Λ_n$, known as boundary conditions. For select boundary conditions that do not carry long-range information (namely, wired and free), Blanca and Sinclair proved that when $q>1$ and $p\neq p_c(q)$, the Glauber dynamics on $Λ_n$ mixes in optimal $O(n^2 \log n)$ time. In this paper, we prove that this mixing time is polynomial in $n$ for every boundary condition that is realizable as a configuration on $\mathbb Z^2 \setminus Λ_{n}$. We then use this to prove near-optimal $\tilde O(n^2)$ mixing time for "typical'' boundary conditions. As a complementary result, we construct classes of non-realizable (non-planar) boundary conditions inducing slow (stretched-exponential) mixing at $p\ll p_c(q)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Blanca, Reza Gheissari, Eric Vigoda. 2019-05-06. Random-cluster dynamics in $\mathbb Z^2$: rapid mixing with general boundary conditions. https://arxiv.org/abs/1807.08722

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