SearcharxivSearch

arXiv · 2302.05398

Infinite-volume states with irreducible localization sets for gradient models on trees

Abstract

We consider general classes of gradient models on regular trees with values in a countable Abelian group $S$ such as $\mathbb{Z}$ or $\mathbb{Z}_q$, in regimes of strong coupling (or low temperature). This includes unbounded spin models like the p-SOS model and finite-alphabet clock models. We prove the existence of families of distinct homogeneous tree-indexed Markov chain Gibbs states $\mu_A$ whose single-site marginals concentrate on a given finite subset $A \subset S$ of spin values, under a strong coupling condition for the interaction, depending only on the cardinality $\vert A \vert$ of $A$. The existence of such states is a new and robust phenomenon which is of particular relevance for infinite spin models. These states are not convex combinations of each other, and in particular the states with $\vert A \vert \geq 2$ can not be decomposed into homogeneous Markov-chain Gibbs states with a single-valued concentration center. As a further application of the method we obtain moreover the existence of new types of $\mathbb{Z}$-valued gradient Gibbs states, whose single-site marginals do not localize, but whose correlation structure depends on the finite set $A$.

Explore related subjects

Keep this discovery

BibTeXRIS

Alberto Abbondandolo, Florian Henning, Christof Kuelske, Pietro Majer. 2023-02-10. Infinite-volume states with irreducible localization sets for gradient models on trees. https://doi.org/10.1007/s10955-024-03278-9

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