SearcharxivSearch

arXiv · 2508.06935

Fredrickson Andersen Model and Noisy Majority Vote Process on Nonamenable Graphs

Abstract

We study the Fredrickson-Andersen j-spin facilitated model and the noisy majority vote process on connected infinite graphs satisfying suitable expansion properties. For the former, we consider the out-of-equilibrium regime where the density of facilitating sites is close to 1, both for the equilibrium product measure and for the initial configuration, and we show exponential convergence to equilibrium. For the latter, we prove the existence of multiple equilibrium measures, generalising recent results by J. Ding and F. Huang (2025). Our proofs build on the framework of decorated set systems introduced by I. Hartarsky and F. Toninelli (2024) and establish exponentially decaying tails for the diameter of the space-time cluster of zeros containing a fixed vertex for both perturbed bootstrap percolation and consensus processes. The results are essentially sharp on hyperbolic lattices and we further show how some of the borderline cases can be handled using Toom contours, in the reformulation by J. M. Swart, R. Szab\'o and C. Toninelli (2022).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Damiano De Gaspari. 2025-08-09. Fredrickson Andersen Model and Noisy Majority Vote Process on Nonamenable Graphs. https://arxiv.org/abs/2508.06935

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