SearcharxivSearch

arXiv · 2112.04976

Cutoff and Dynamical Phase Transition for the General Multi-component Ising Model

Abstract

We study the multi-component Ising model, which is also known as the block Ising model. In this model, the particles are partitioned into a fixed number of groups with a fixed proportion, and the interaction strength is determined by the group to which each particle belongs. We demonstrate that the Glauber dynamics on our model exhibits the cutoff$\mbox{--}$metastability phase transition as passing the critical inverse-temperature $\beta_{cr}$, which is determined by the proportion of the groups and their interaction strengths, regardless of the total number of particles. For $\beta<\beta_{cr}$, the dynamics shows a cutoff at $\alpha n\log n$ with a window size $O(n)$, where $\alpha$ is a constant independent of $n$. For $\beta=\beta_{cr}$, we prove that the mixing time is of order $n^{3/2}$. In particular, we deduce the so-called non-central limit theorem for the block magnetizations to validate the optimal bound at $\beta=\beta_{cr}$. For $\beta>\beta_{cr}$, we examine the metastability, which refers to the exponential mixing time. Our results, based on the position of the employed Ising model on the complete multipartite graph, generalize the results of previous versions of the model.

Explore related subjects

Keep this discovery

BibTeXRIS

Seoyeon Yang. 2021-12-09. Cutoff and Dynamical Phase Transition for the General Multi-component Ising Model. https://doi.org/10.1007/s10955-023-03162-y

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