Related papers: Annealed limit theorems for the ising model on ran…
We relate the planar random current representation introduced by Griffiths, Hurst and Sherman to the dimer model. More precisely, we provide a measure-preserving map between double random currents (obtained as the sum of two independent…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
The purpose of this modest note is to point out that the proof of the recent result of Huchcroft concerning continuity of phase transition in Bernoulli percolation is applicable to the setting of the Ising model with free boundary…
We study joint estimation of the inverse temperature and magnetization parameters $(\beta,B)$ of an Ising model with a non-negative coupling matrix $A_n$ of size $n\times n$, given one sample from the Ising model. We give a general bound on…
We consider independently identically distributed random compositions of the Gauss and R\'enyi maps that generate random continued fractions. Using methods of ergodic theory, thermodynamic formalism and large deviations, we show that…
The zero-temperature Ising model is known to reach a fully ordered ground state in sufficiently dense random graphs. In sparse random graphs, the dynamics gets absorbed in disordered local minima at magnetization close to zero. Here, we…
Let $X=(X_t, t\geq 0)$ be a superprocess in a random environment described by a Gaussian noise $W=\{W(t,x), t\geq 0, x\in \mathbb{R}^d\}$ white in time and colored in space with correlation kernel $g(x,y)$. When $d\geq 3$, under the…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…
The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate counting: approximating the partition function of the…
We study the dynamics of macroscopic observables such as the magnetization and the energy per degree of freedom in Ising spin models on random graphs of finite connectivity, with random bonds and/or heterogeneous degree distributions. To do…
In this work we show that with high probability the chromatic number of a graph sampled from the random regular graph model $\Gnd$ for $d=o(n^{1/5})$ is concentrated in two consecutive values, thus extending a previous result of Achlioptas…
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…
Using T=0 Monte Carlo and simulated annealing simulation, we study the energy relaxation of ferromagnetic Ising and Potts models on random graphs. In addition to the expected exponential decay to a zero energy ground state, a range of…
Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they…
The current status of experiments on the d=2 and d=3 random-exchange and random-field Ising models, as realized in dilute anisotropic antiferromagnets, is discussed. Two areas of current investigation are emphasized. For d=3, the large…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
The quenched free energy of spin glasses is estimated by means of annealed averages where the frustration is constrained to its average value. We discuss the case of d-dimensional Ising models with random nearest neighbour coupling, and we…