PreprintCC BY 4.0arXiv
Mixing profile for Glauber dynamics of the discrete Gaussian Free Field starting from super-harmonic functions
Abstract
We study the convergence rate of the heat-bath Glauber dynamics for the Discrete Gaussian Free Field on arbitrary connected finite graphs. We show that, when starting from super-harmonic initial conditions, the evolution enjoys a strong form of monotonicity. This allows us to get a sharp mixing profile as the size of the graphs diverges. More precisely, we show that mixing occurs at time 1/2λlog(ℰ) with window 𝒪(1/λ), where λ is the spectral gap of the graph Laplacian and ℰ is the energy of the super-harmonic initial condition. This result holds for arbitrary graphs that do not exhibit extreme connectivity properties (one way or the other). In particular, it holds for finite boxes of the grid ℤd, in dimension d≥ 3.
Related
- Order elevation of directly self-starting sub-step implicit integrators for transient dynamics
- The Discrete Harmonic Center of a Quadrilateral
- Harmonic functions and comparsion geometry for noncompact 3-manifolds with nonnegative scalar curvature
- Gradient estimates and Liouville theorems for exponentially harmonic functions
- Poisson representations of Dunkl harmonic functions satisfying a Carleson condition
BibTeX
@misc{bristiel2026mixing,
title = {{Mixing profile for Glauber dynamics of the discrete Gaussian Free Field starting from super-harmonic functions}},
author = {Alexandre Bristiel},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.27689},
eprint = {2609.27689},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.27689},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Mixing profile for Glauber dynamics of the discrete Gaussian Free Field starting from super-harmonic functions
AU - Alexandre Bristiel
PY - 2026
DA - 2026/09/24
PB - arXiv
DO - 10.48550/arxiv.2609.27689
UR - https://arxiv.org/abs/2609.27689
AB - We study the convergence rate of the heat-bath Glauber dynamics for the Discrete Gaussian Free Field on arbitrary connected finite graphs. We show that, when starting from super-harmonic initial conditions, the evolution enjoys a strong form of monotonicity. This allows us to get a sharp mixing profile as the size of the graphs diverges. More precisely, we show that mixing occurs at time 1/2λlog(ℰ) with window 𝒪(1/λ), where λ is the spectral gap of the graph Laplacian and ℰ is the energy of the super-harmonic initial condition. This result holds for arbitrary graphs that do not exhibit extreme connectivity properties (one way or the other). In particular, it holds for finite boxes of the grid ℤ^d, in dimension d≥ 3.
ER -