SearcharxivSearch

arXiv · 2411.13465

Height-offset variables and pinning at infinity for gradient Gibbs measures on trees

Abstract

Height-offset variables (HOVs) provide a mechanism, known as "pinning at infinity", to lift gradient Gibbs measures (GGMs) - describing interface increments - to proper Gibbs measures that describe absolute heights. Starting from Sheffield's seminal framework, we study HOVs for nearest-neighbor integer-valued gradient models on regular trees, under broad classes of transfer operators requiring only finite second moments and without assuming convexity. We first establish the existence of HOVs as martingale limits, prove the infinite differentiability of their Lebesgue densities, and demonstrate exponential concentration for the associated pinned Gibbs measures. Next we uncover a fundamental trade-off, as the Gibbs measures arising by "pinning at infinity" paradoxically lose several desirable structural properties. We rigorously show that they lose tree-automorphism invariance, the tree-indexed Markov chain property, and extremality within the class of Gibbs measures. Our analysis relies on martingale theory, novel past- and future-tail decompositions, and infinite product representations for moment generating functions, and it applies to free GGMs, as well as to GGMs of height-period two.

Explore related subjects

Keep this discovery

BibTeXRIS

Florian Henning, Christof Kuelske. 2024-11-20. Height-offset variables and pinning at infinity for gradient Gibbs measures on trees. https://arxiv.org/abs/2411.13465

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