SearcharxivSearch

arXiv · 2402.07807

Fixation for $\mathcal{U}$-Ising and $\mathcal{U}$-voter dynamics with frozen vertices

Abstract

The zero-temperature stochastic Ising model is a special case of the famous stochastic Ising model of statistical mechanics, and the voter model is another classical model in this field. In both models, each vertex of the graph $\mathbb{Z}^d$ can have one of two states, and can change state to match the state of its neighbors. In 2017, Morris proposed generalizations of these models, the $\mathcal{U}$-Ising and $\mathcal{U}$-voter dynamics, in which a vertex can change state to match the state of certain subsets of vertices near it. These generalizations were inspired by similar generalizations in the related model of bootstrap percolation, where Balister, Bollob\'as, Duminil-Copin, Morris, Przykucki, Smith and Uzzell were able to establish a very impressive universality classification of the generalized models. However, there have been very few results on the $\mathcal{U}$-Ising and $\mathcal{U}$-voter dynamics. The only one is due to Blanquicett in 2021, who obtained a few encouraging advances on the important question of fixation, which is only partially solved for the zero-temperature stochastic Ising model: will all vertices eventually settle on a given state or will they oscillate forever between the two states? In this work, we tackle a question which was solved for the zero-temperature stochastic Ising model by Damron, Eckner, Kogan, Newman and Sidoravicius in 2015: fixation when a fraction of the vertices of $\mathbb{Z}^d$ are frozen in one of the states. For $d=1$ and $2$, in most cases we prove that if all frozen vertices are in the same state, all vertices eventually settle at this state. Moreover, if vertices can be frozen in both states but the proportion of vertices frozen in the second state is small enough, we were able to establish a universality classification identifying the models in which all vertices settle in a given state.

Explore related subjects

Keep this discovery

BibTeXRIS

Laure Marêché. 2024-02-12. Fixation for $\mathcal{U}$-Ising and $\mathcal{U}$-voter dynamics with frozen vertices. https://doi.org/10.30757/alea.v22-05

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