Related papers: Ising models on locally tree-like graphs
We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…
Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…
We investigate the Gibbs-measures of ferromagnetically coupled continuous spins in double-well potentials subjected to a random field (our specific example being the $\phi^4$ theory), showing ferromagnetic ordering in $d\geq 3$ dimensions…
In this paper, we study the fluctuations of the average magnetization in an Ising model on an approximately $d_N$ regular graph $G_N$ on $N$ vertices. In particular, if $G_N$ is \enquote{well connected}, we show that whenever $d_N\gg…
Belief propagation is a fundamental message-passing algorithm for numerous applications in machine learning. It is known that belief propagation algorithm is exact on tree graphs. However, belief propagation is run on loopy graphs in most…
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as…
We study the random-field Ising model with long-range interactions and show the exactness of the mean-field theory under certain mild conditions. This is a generalization of the result of Mori for the non-random and spin-glass cases. To…
Systems with many interacting stochastic constituents are fully characterized by their free energy. Computing this quantity is therefore the objective of various approaches, notably perturbative expansions, which are applied in problems…
The Ising model in a random field and with power-law decaying ferromagnetic bonds is studied at zero temperature. Comparing the scaling of the energy contributions of the ferromagnetic domain wall flip and of the random field a la Imry-Ma…
We compute the fluctuations of the magnetization and of the multi-overlaps for the dilute mean field ferromagnet, in the high temperature region. The rescaled magnetization tends to a centered Gaussian variable with variance diverging at…
We investigate the geometry of a typical spin cluster in random triangulations sampled with a probability proportional to the energy of an Ising configuration on their vertices, both in the finite and infinite volume settings. This model is…
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
We consider $h$-stable local optima of Ising spin glass models, defined as spin configurations such that for nearly all of the spins, flipping their values results in increasing energy by at least a given amount $h$. Spins satisfying this…
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both…
On any locally-finite geometry, the stochastic Ising model is known to be contractive when the inverse-temperature $\beta$ is small enough, via classical results of Dobrushin and of Holley in the 1970's. By a general principle proposed by…
We consider the free boundary condition Gibbs measure of the Potts model on a random tree. We provide an explicit temperature interval below the ferromagnetic transition temperature for which this measure is extremal, improving older bounds…
We study the belief propagation algorithm for the graph bi-partitioning problem, i.e. the ground state of the ferromagnetic Ising model at a fixed magnetization. Application of a message passing scheme to a model with a fixed global…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
We consider the Ising model on a supercritical Galton-Watson tree $\mathbf{T}_n$ of depth $n$ with a sparse random external field, given by a collection of i.i.d. Bernouilli random variables with vanishing parameter $p_n$. This may me…