Related papers: Ising models on locally tree-like graphs

We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings of maximal weight converge locally to a matching on the…

We develop a recently-proposed mapping of the two-dimensional Ising model with random exchange (RBIM), via the transfer matrix, to a network model for a disordered system of non-interacting fermions. The RBIM transforms in this way to a…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

We consider spin models on complex networks frequently used to model social and technological systems. We study the annealed ferromagnetic Ising model for random networks with either independent edges (Erd\H{o}s-R\'enyi), or with prescribed…

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…

We propose a method to find out the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field $B_s = +\infty$, $B_{t} =…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

We conjecture an approximate expression for the free energy in the thermodynamic limit of the classical square lattice Ising model in a uniform (real) magnetic field. The zero-field result is well known due to Onsager for more than eighty…

We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…

We present a criterion for a family of random distributions to be tight in local H\"older and Besov spaces of possibly negative regularity. We then apply this criterion to the magnetization field of the two-dimensional Ising model at…

We study the thermodynamic properties of spin systems on small-world hypergraphs, obtained by superimposing sparse Poisson random graphs with p-spin interactions onto a one-dimensional Ising chain with nearest-neighbor interactions. We use…

We train a set of Restricted Boltzmann Machines (RBMs) on one- and two-dimensional Ising spin configurations at various values of temperature, generated using Monte Carlo simulations. We validate the training procedure by monitoring several…

We continue our analysis of Ising models on the (directed) Erd\H{o}s-R\'enyi random graph $G(N,p)$. We prove a quenched Central Limit Theorem for the magnetization and describe the fluctuations of the log-partition function. In the current…

We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below…

We consider the stochastic dynamics near zero-temperature of the random ferromagnetic Ising model on a Cayley tree of branching ratio $K$. We apply the Boundary Real Space Renormalization procedure introduced in our previous work (C.…

We consider random transverse-field Ising spin chains and study the magnetization and the energy-density profiles by numerically exact calculations in rather large finite systems ($L\le 128$). Using different boundary conditions (free,…

We show that for any infinite tree of finite cone type satisfying a mild expansion condition, the only typical process on its vertices with covariance induced by the Green's function is the Gaussian wave. This generalizes a result of…

Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…