SearcharxivSearch

arXiv · 2212.13746

Approximation method to metastability: an application to non-reversible, two-dimensional Ising and Potts models without external fields

Abstract

The main contribution of the current study is two-fold. First, we investigate the energy landscape of the Ising and Potts models on finite two-dimensional lattices without external fields in the low temperature regime. The complete analysis of the energy landscape of these models was unknown because of its complicated plateau saddle structure between the ground states. We characterize this structure completely in terms of a random walk on the set of sub-trees of a ladder graph. Second, we provide a considerable simplification of the well-known potential-theoretic approach to metastability. In particular, by replacing the role of variational principles such as the Dirichlet and Thomson principles with an $H^1$-approximation of the equilibrium potential, we develop a new method that can be applied to non-reversible dynamics as well in a simple manner. As an application of this method, we analyze metastable behavior of not only the reversible Metropolis-Hastings dynamics, but also of several interesting non-reversible dynamics associated with the low-temperature Ising and Potts models explained above, and derive the Eyring-Kramers law and the Markov chain model reduction of these models.

Explore related subjects

Keep this discovery

BibTeXRIS

Seonwoo Kim, Insuk Seo. 2022-12-28. Approximation method to metastability: an application to non-reversible, two-dimensional Ising and Potts models without external fields. https://arxiv.org/abs/2212.13746

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