SearcharxivSearch

arXiv · 1705.03589

Gibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees

Abstract

Consider a statistical physical model on the $d$-regular infinite tree $T_{d}$ described by a set of interactions $\Phi$. Let $\{G_{n}\}$ be a sequence of finite graphs with vertex sets $V_n$ that locally converge to $T_{d}$. From $\Phi$ one can construct a sequence of corresponding models on the graphs $G_n$. Let $\{\mu_n\}$ be the resulting Gibbs measures. Here we assume that $\{\mu_{n}\}$ converges to some limiting Gibbs measure $\mu$ on $T_{d}$ in the local weak$^*$ sense, and study the consequences of this convergence for the specific entropies $|V_n|^{-1}H(\mu_n)$. We show that the limit supremum of $|V_n|^{-1}H(\mu_n)$ is bounded above by the \emph{percolative entropy} $H_{perc}(\mu)$, a function of $\mu$ itself, and that $|V_n|^{-1}H(\mu_n)$ actually converges to $H_{perc}(\mu)$ in case $\Phi$ exhibits strong spatial mixing on $T_d$. We discuss a few examples of well-known models for which the latter result holds in the high temperature regime.

Explore related subjects

Keep this discovery

BibTeXRIS

Tim Austin, Moumanti Podder. 2017-05-10. Gibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees. https://doi.org/10.1007/s10955-018-1959-3

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