Glauber dynamics and coupling-from-the-past for Gaussian fields
Pith reviewed 2026-05-23 19:30 UTC · model grok-4.3
The pith
For small enough neighbor interaction the Gaussian field on Z^d is an explicit factor of an i.i.d. process.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For sufficiently small ε the distribution of the field can be written as an explicit factor of an i.i.d. process. Approximations by finitely dependent fields are close in total variation to the original field with exponential decay when the allowed range of dependence grows. The proof first treats a truncated version of the model to obtain finitary coding with exponential tails and then extends the argument to the original model by a stratified coupling construction suited to continuous unbounded states.
What carries the argument
Coupling-from-the-past combined with stratified coupling adapted to continuous unbounded states.
If this is right
- The field admits an explicit factor representation from i.i.d. noise when ε is small.
- Finitely dependent approximations converge exponentially fast in total variation distance to the true field.
- A truncated version of the model admits finitary coding with exponential tails.
Where Pith is reading between the lines
- The factor representation may allow direct generation of the field from independent noise without iterative dynamics.
- The stratified coupling technique could be tested on other lattice models with continuous states and weak local dependence.
- Exponential approximation rates suggest that moderate-range dependence suffices for high-accuracy sampling in practice.
Load-bearing premise
The interaction parameter ε must be small enough that the coupling-from-the-past construction succeeds almost surely and yields the correct stationary distribution.
What would settle it
An explicit computation or simulation showing that for some ε below the paper's threshold the total variation distance to every finitely dependent field fails to decay exponentially with range.
read the original 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.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies stationary Gaussian Markov random fields on Z^d whose conditional distribution at each site is Gaussian with mean ε times the average of its neighbors and variance 1. It proves that for sufficiently small ε the field admits an explicit factor-of-i.i.d. representation via coupling-from-the-past. The argument first establishes finitary coding with exponential tails for a truncated version of the model by verifying the Häggström-Steif high-noise condition on an uncountable state space; it then extends the construction to the original unbounded Gaussian field by introducing a stratified coupling that is asserted to preserve the target conditional laws while ensuring almost-sure termination of CFTP. Quantitative approximation by finitely dependent fields with exponential total-variation decay is also obtained.
Significance. If the stratified-coupling argument is correct, the manuscript supplies a new application of the Häggström-Steif condition to continuous alphabets and a concrete extension of classical CFTP techniques to unbounded Gaussian fields, together with explicit factor representations and strong approximation rates. These results enlarge the class of Markov random fields known to be factors of i.i.d. processes and furnish quantitative control on the dependence range.
major comments (2)
- [§4] §4 (stratified coupling for the untruncated model): the construction asserts that the stratified updates produce a factor whose one-dimensional marginals coincide with the target conditional Gaussian law, yet no explicit invariance calculation is supplied showing that the acceptance/rejection or level-selection rule leaves the conditional distribution at each site unchanged. This invariance is load-bearing for the claim that the output measure equals the original field.
- [Theorem 1.3] Theorem 1.3 (main result for the original model): the proof that the CFTP output is distributed exactly according to the Gaussian MRF relies on the termination probability being positive for small ε together with the invariance of the stratified kernel; without a self-contained verification of the latter, the reduction from the truncated case does not automatically carry over to the unbounded setting.
minor comments (2)
- [Definition 3.4] The partitioning of R into strata (Definition 3.4) should include an explicit formula for the stratum boundaries and the associated proposal kernels so that the reader can directly check the invariance identity.
- [§2] Notation for the neighbor average in the conditional mean should be introduced once and used consistently; the current alternation between “average of neighbors” and “local mean” is minor but distracting.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for identifying the need for greater explicitness in the invariance argument for the stratified coupling. We address each major comment below and will incorporate the requested clarifications.
read point-by-point responses
-
Referee: [§4] §4 (stratified coupling for the untruncated model): the construction asserts that the stratified updates produce a factor whose one-dimensional marginals coincide with the target conditional Gaussian law, yet no explicit invariance calculation is supplied showing that the acceptance/rejection or level-selection rule leaves the conditional distribution at each site unchanged. This invariance is load-bearing for the claim that the output measure equals the original field.
Authors: We agree that an explicit, self-contained invariance calculation is desirable for clarity. In the revised manuscript we will insert a new lemma in §4 that directly verifies that the level-selection rule (together with any acceptance/rejection step) leaves each site’s one-dimensional marginal equal to the target conditional Gaussian. The argument proceeds by conditioning on the neighboring values and showing that the stratification is measure-preserving with respect to the Gaussian kernel; this is a routine but previously omitted calculation that does not alter the overall construction. revision: yes
-
Referee: [Theorem 1.3] Theorem 1.3 (main result for the original model): the proof that the CFTP output is distributed exactly according to the Gaussian MRF relies on the termination probability being positive for small ε together with the invariance of the stratified kernel; without a self-contained verification of the latter, the reduction from the truncated case does not automatically carry over to the unbounded setting.
Authors: Once the explicit invariance lemma is added to §4, the reduction to the unbounded model becomes fully rigorous: the positive termination probability already established for the truncated field carries over verbatim because the stratification is applied only after the high-noise condition has been verified, and the marginal-preserving property ensures the CFTP output has the correct law. We will also add a short paragraph in the proof of Theorem 1.3 that cites the new lemma to make the logical dependence explicit. revision: yes
Circularity Check
No circularity; constructions apply external CFTP and Häggström-Steif to new model
full rationale
The paper applies established external techniques (Häggström-Steif high-noise condition for finitary coding, classical CFTP) to a Gaussian MRF model defined by conditional Gaussians. It develops a stratified coupling extension for the continuous unbounded case but presents this as a new method rather than a reduction of the target distribution to fitted inputs or self-referential definitions. No self-citations are load-bearing, no parameters are fitted then renamed as predictions, and the factor-of-i.i.d. representation and finite-dependence approximations are constructed from these independent tools. The derivation chain is self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Conditional distributions of the field are Gaussian with the stated mean and variance 1
- standard math Coupling-from-the-past techniques apply to the truncated model via the high-noise condition
Reference graph
Works this paper leans on
-
[1]
Følner independence and the amenable Ising model.Ergodic Theory Dynam
Scot Adams. Følner independence and the amenable Ising model.Ergodic Theory Dynam. Systems, 12(4):633–657, 1992
work page 1992
-
[2]
M. Aizenman and R. Fernández. On the critical behavior of the magnetization in high- dimensional Ising models.J. Statist. Phys., 44(3-4):393–454, 1986
work page 1986
-
[3]
Random currents and continuity of Ising model’s spontaneous magnetization.Comm
Michael Aizenman, Hugo Duminil-Copin, and Vladas Sidoravicius. Random currents and continuity of Ising model’s spontaneous magnetization.Comm. Math. Phys., 334(2):719– 742, 2015
work page 2015
-
[4]
M. B. Averintsev. Description of Markovian Random Fields by Gibbsian Conditional Probabilities. Theory of Probability & Its Applications, 17(1):20–33, 1972
work page 1972
-
[5]
P. Clifford and J.M. Hammersley. Markov fields on finite graphs and lattices, 1971. Avail- able at https://www.statslab.cam.ac.uk/~grg/books/hammfest/hamm-cliff.pdf
work page 1971
-
[6]
P. L. Dobrushin. The description of a random field by means of conditional probabilities and conditions of its regularity.Theory of Probability & Its Applications, 13(2):197–224, 1968
work page 1968
-
[7]
Lecture notes on particle systems and percolation.American Scientist 1990-may-jun vol
Richard Durrett. Lecture notes on particle systems and percolation.American Scientist 1990-may-jun vol. 78 iss. 3, 78, may 1990
work page 1990
-
[8]
Subcritical Boolean percolation on graphs of bounded degree, 2024
Corentin Faipeur. Subcritical Boolean percolation on graphs of bounded degree, 2024. Available athttps://arxiv.org/abs/2410.15722
-
[9]
Pedro J. Fernández, Pablo A. Ferrari, and Sebastian P. Grynberg. Perfectly random sam- pling of truncated multinormal distributions.Advances in Applied Probability, 39(4):973– 990, 2007
work page 2007
-
[10]
Cambridge University Press, 2017
Sacha Friedli and Yvan Velenik.Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction. Cambridge University Press, 2017
work page 2017
-
[11]
Gibbs Measures and Phase Transitions, Second Edition
Hans-Otto Georgii. Gibbs Measures and Phase Transitions, Second Edition. De Gruyter Studies in Mathematics volume 9. De Gruyter, 2 edition, 2011
work page 2011
-
[12]
Roy J Glauber. Time-dependent statistics of the Ising model.Journal of Mathematical Physics (New York) (U.S.), Vol: 4, 2 1963
work page 1963
-
[13]
Olle Häggström and Jeffrey E. Steif. Propp-Wilson algorithms and finitary codings for high noise Markov random fields.Combin. Probab. Comput., 9(5):425–439, 2000
work page 2000
-
[14]
Nearest-neighbor Markov interaction processes on multidimensional lattices
T.E Harris. Nearest-neighbor Markov interaction processes on multidimensional lattices. Advances in Mathematics, 9(1):66–89, 1972
work page 1972
-
[15]
RecentresultsonthestochasticIsingmodel
RichardHolley. RecentresultsonthestochasticIsingmodel. The Rocky Mountain Journal of Mathematics, 4(3):479–496, 1974. 39
work page 1974
-
[16]
O. E. Lanford III and D. Ruelle. Observables at infinity and states with short range correlations in statistical mechanics.Communications in Mathematical Physics, 13(3):194 – 215, 1969
work page 1969
-
[17]
Commuting measure-preserving transforma- tions
Yitzhak Katznelson and Benjamin Weiss. Commuting measure-preserving transforma- tions. Israel J. Math., 12:161–173, 1972
work page 1972
-
[18]
John Lamperti. Maximal Branching Processes and ’Long-Range Percolation’.Journal of Applied Probability, 7(1):89–98, 1970
work page 1970
-
[19]
Liggett.Interacting Particle Systems
Thomas M. Liggett.Interacting Particle Systems. Springer Berlin Heidelberg, 1985
work page 1985
-
[20]
Thomas M. Liggett. Continuous Time Markov Processes: An Introduction. Graduate studies in mathematics. American Mathematical Society, 2010
work page 2010
-
[21]
D. J. Murdoch and P. J. Green. Exact sampling from a continuous state space.Scand. J. Statist., 25(3):483–502, 1998
work page 1998
-
[22]
Ornstein.Ergodic theory, randomness, and dynamical systems, volume No
Donald S. Ornstein.Ergodic theory, randomness, and dynamical systems, volume No. 5 of Yale Mathematical Monographs. Yale University Press, New Haven, Conn.-London, 1974. James K. Whittemore Lectures in Mathematics given at Yale University
work page 1974
-
[23]
Donald S. Ornstein and Benjamin Weiss. Entropy and isomorphism theorems for actions of amenable groups.J. Analyse Math., 48:1–141, 1987
work page 1987
-
[24]
J.G. Propp and D.B. Wilson. Exact sampling with coupled Markov chains and applica- tions to statistical mechanics.Random Structures Algorithms, 1996
work page 1996
-
[25]
Finitary coding for the sub-critical Ising model with finite expected coding volume
Yinon Spinka. Finitary coding for the sub-critical Ising model with finite expected coding volume. Electronic Journal of Probability, 25(none):1 – 27, 2020
work page 2020
-
[26]
Yinon Spinka. Finitary codings for spatial mixing Markov random fields.The Annals of Probability, 48(3):1557 – 1591, 2020
work page 2020
-
[27]
Finitely dependent processes are finitary
Yinon Spinka. Finitely dependent processes are finitary. The Annals of Probability, 48(4):2088 – 2117, 2020
work page 2088
-
[28]
Markovrandomfieldsand Gibbs ensembles
FrankSpitzer. Markovrandomfieldsand Gibbs ensembles. Amer. Math. Monthly, 78:142– 154, 1971
work page 1971
-
[29]
J. E. Steif and J. van den Berg. On the Existence and Nonexistence of Finitary Codings for a Class of Random Fields.The Annals of Probability, 27(3):1501 – 1522, 1999
work page 1999
-
[30]
Probability and its Appli- cations (New York)
Hermann Thorisson.Coupling, stationarity, and regeneration. Probability and its Appli- cations (New York). Springer-Verlag, New York, 2000
work page 2000
-
[31]
J. van den Berg and C. Maes. Disagreement percolation in the study of Markov fields. Ann. Probab., 22(2):749–763, 1994
work page 1994
-
[32]
C. N. Yang. The spontaneous magnetization of a two-dimensional Ising model.Phys. Rev. (2), 85:808–816, 1952. 40
work page 1952
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.