SearcharxivSearch

arXiv · 2509.17518

Stationary fluctuations for occupation times of the long-range voter models on lattices

Abstract

In this paper, we are concerned with the long-range voter model on lattices. We prove a stationary fluctuation theorem for the occupation time of the model under a proper time-space scaling. In several cases, the fluctuation limits are driven by fractional Brownian motions with Hurst parameters in $(1/2, 1)$. The proof of our main result utilizes the martingale decomposition strategy introduced in \cite{Kipnis1987}. A local central limit theorem of the long-range random walk, the duality relationship between the model and the long-range coalescing random walk and a fluctuation theorem of the empirical density field of the model play the key roles in the proof.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaofeng Xue. 2025-09-22. Stationary fluctuations for occupation times of the long-range voter models on lattices. https://arxiv.org/abs/2509.17518

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