Search arXivSearch

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äggström 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

Explore connections, maps & timelines

BibTeXRIS

Corentin Faipeur. 2026-05-13. 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

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR