SearcharxivSearch

arXiv · 2602.19469

A Class of Gaussian Fields on $\mathbb{Z}_q^d$

Abstract

Gaussian fields $(g_x)$ on $\mathbb{Z}_q^d$ are constructed from a class of reversible long range random walks $(X_t)_{t\in \mathbb{N}}$ on $\mathbb{Z}_q^d$ in arXiv:2510.22554. The construction is from taking the covariance function of $(g_x)$ as $(1-\alpha)G(x,y;\alpha)$, where $G(x,y;\alpha)$ is the Green function of a random walk with killing in each transition at rate $1-\alpha$. A decomposition of the Gaussian field into a sum of independent Gaussian random variables is made. By letting $q\to \infty$ the Gaussian field becomes defined from an infinite-dimensional random walk on a torus. The random walk model is also extended to $d=\infty$ by considering a de Finetti random walk where entries in the increments of the random walk are exchangeable. A limit Gaussian field on $\mathbb{R}^d$ arises from a central limit theorem approach. The transform of this Gaussian field, which is again a Gaussian field, is calculated. It has a simpler covariance matrix than the original field. The Hamiltonian connected to the Gaussian field is calculated. A limit theorem for the partition function arising from the Hamiltonian is found.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Griffiths, Shuhei Mano. 2026-02-23. A Class of Gaussian Fields on $\mathbb{Z}_q^d$. https://arxiv.org/abs/2602.19469

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