SearcharxivSearch

arXiv · 2410.18504

Glauber dynamics and coupling-from-the-past for Gaussian fields

Abstract

We study the representation of stationary Gaussian Markov random fields as factors of i.i.d. processes, with a focus on their approximation by finitely dependent distributions. Our model is a Gaussian field on $\mathbf{Z}^d$ such that the conditional law of the field at any site is Gaussian of mean $\varepsilon$ times the average of its neighbours, and of variance 1. Building on coupling-from-the-past (CFTP) techniques, we prove that for sufficiently small $\varepsilon$, the distribution of the field can be written as an explicit factor of an i.i.d. process. Furthermore, we construct approximations by finitely dependent fields that are close in total variation to the original field, with exponential decay when the allowed range of dependence grows. We first do the proof for a truncated version of this Gaussian model, showing in this case that the associated field admits a finitary coding with exponential tails, providing a new application of high-noise condition of H\"aggstr\"om and Steif \cite{HaggstromSteif} for an uncountable state space. The proof for the original model is more intricate. Our approach extends classical CFTP-based constructions by developing a stratified coupling method tailored to the continuous and unbounded nature of the Gaussian setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Corentin Faipeur. 2024-10-24. Glauber dynamics and coupling-from-the-past for Gaussian fields. https://doi.org/10.1214/26-ejp1542

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