اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIsing models on locally tree-like graphs
165
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the cavity prediction for the limiting free energy per spin is correct for any positive temperature and external field. Further, local marginals can be approximated by iterating a set of mean field (cavity) equations. Both results are achieved by proving the local convergence of the Boltzmann distribution on the original graph to the Boltzmann distribution on the appropriate infinite random tree.
قيم البحث
اقرأ أيضاً
In a recent paper [15], Giardin{`a}, Giberti, Hofstad, Prioriello have proved a law of large number and a central limit theorem with respect to the annealed measure for the magnetization of the Ising model on some random graphs including the random 2
-regular graph. We present a new proof of their results, which applies to all random regular graphs. In addition, we prove the existence of annealed pressure in the case of configuration model random graphs.
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This class include
s in particular the configuration model and the family of inhomogeneous random graphs with rank-1 kernel. Vertices in the graph are allowed to have attributes on a general separable metric space and can potentially influence the construction of the graph itself. The coupling holds for any fixed depth of a breadth-first exploration process.
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 construc
t 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.
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away observations. Several theoretical results (and simple algorithms) are available when their join
t probability distribution is Markov with respect to a tree. In this paper we consider the case of sequences of random graphs that converge locally to trees. In particular, we develop a sufficient condition for the tree and graph reconstruction problem to coincide. We apply such condition to colorings of random graphs. Further, we characterize the behavior of Ising models on such graphs, both with attractive and random interactions (respectively, `ferromagnetic and `spin glass).
We study infinite ``$+$ or ``$-$ clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli site percolat
ion on $G$ is less than $frac{1}{2}$, we find an explicit region for the coupling constant of the Ising model such that there are infinitely many infinite ``$+$-clusters and infinitely many infinite ``$-$-clusters, while the random cluster representation of the Ising model has no infinite 1-clusters. If $p_c^{site}>frac{1}{2}$, we obtain a lower bound for the critical probability in the random cluster representation of the Ising model in terms of $p_c^{site}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
