We analyze Ising/Curie-Weiss models on the Erdős-Rényi graph with $N$ vertices and edge probability $p=p(N)$ that were introduced by Bovier and Gayrard [J.\ Statist.\ Phys., 72(3-4):643--664, 1993] and investigated in two previous articles by the authors. We prove Central Limit Theorems for the partition function of the model and -- at other decay regimes of $p(N)$ -- for the logarithmic partition function. We find critical regimes for $p(N)$ at which the behavior of the fluctuations of the partition function changes.
We analyze Ising/Curie-Weiss models on the (directed) Erdős-Rényi random graph on $N$ vertices in which every edge is present with probability $p$. These models were introduced by Bovier and Gayrard [J. Stat. Phys., 1993]. We prove a quenched Central Limit Theorem for the magnetization in the high-temperature regime $β<1$ when $p=p(N)$ satisfies $p^3N^2\to +\infty$.
We continue our analysis of Ising models on the (directed) Erdős-Rényi 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 note we consider the low temperature regime $β>1$ and the case when an external magnetic field is present. In both cases, we assume that $p=p(N)$ satisfies $p^3N \to \infty$.
We continue our analysis of Ising models on the (directed) Erdős-Rényi random graph. This graph is constructed on $N$ vertices and every edge has probability $p$ to be present. These models were introduced by Bovier and Gayrard [J. Stat. Phys., 1993] and analyzed by the authors in a previous note, in which we consider the case of $p=p(N)$ satisfying $p^3N^2\to +\infty$ and $β<1$. In the current note we prove a quenched Central Limit Theorem for the magnetization for $p$ satisfying $pN \to \infty$ in the high-temperature regime $β<1$. We also show a non-standard Central Limit Theorem for $p^4N^…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{é}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a metastable result for the extinction time is also proved.
We prove general nonlinear large deviation estimates similar to Chatterjee-Dembo's original bounds except that we do not require any second order smoothness. Our approach relies on convex analysis arguments and is valid for a broad class of distributions. Our results are then applied in three different setups. Our first application consists in the mean-field approximation of the partition function of the Ising model under an optimal assumption on the spectra of the adjacency matrices of the sequence of graphs. Next, we apply our general large deviation bound to investigate the large deviation …
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β<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs samplers for the ferromagnetic Ising model on any graph of n vertices and maximal degree d, where all interactions are bounded by $β$, and arbitrary external fields are bounded by $Cn\log n$. Moreover, the spectral gap is uniformly bounded away from 0 for all such graphs, as well as for infinite graphs of maximal degree d. We further show that when $d\tanhβ<1$, with h…
We consider the $t$-improper chromatic number of the Erd{\H o}s-R{é}nyi random graph $G(n,p)$. The t-improper chromatic number $χ^t(G)$ of $G$ is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most $t$. If $t = 0$, then this is the usual notion of proper colouring. When the edge probability $p$ is constant, we provide a detailed description of the asymptotic behaviour of $χ^t(G(n,p))$ over the range of choices for the growth of $t = t(n)$.
Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erdős-R{\' e}nyi random graphs by Chatterjee and Varadhan. Furthermore, we translate the LDP for random graphs to a class of interacting dynamical systems on such graphs. To this end, we demonstrate that the solutions of the dynamical models depend continuously on the underlying graphs with respect to the cut-norm and apply the contraction principle.
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 \sqrt{N}$, the fluctuations are universal and same as that of the Curie-Weiss model in the entire Ferro-magnetic parameter regime. We give a counterexample to demonstrate that the condition $d_N\gg \sqrt{N}$ is tight, in the sense that the limiting distribution changes if $d_N\sim \sqrt{N}$ except in the high temperature regime. By refining our argument, we extend…
The contact model for the spread of disease may be viewed as a directed percolation model on $\ZZ \times \RR$ in which the continuum axis is oriented in the direction of increasing time. Techniques from percolation have enabled a fairly complete analysis of the contact model at and near its critical point. The corresponding process when the time-axis is unoriented is an undirected percolation model to which now standard techniques may be applied. One may construct in similar vein a random-cluster model on $\ZZ \times \RR$, with associated continuum Ising and Potts models. These models are of i…
We identify the asymptotic distribution of $p$-rank of the sandpile group of a random directed bipartite graphs which are not too imbalanced. We show this matches exactly that of the Erd{ö}s-R{é}nyi random directed graph model, suggesting the Sylow $p$-subgroups of this model may also be Cohen-Lenstra distributed. Our work builds on results of Koplewitz who studied $p$-rank distributions for unbalanced random bipartite graphs, and showed that for sufficiently unbalanced graphs, the distribution of $p$-rank differs from the Cohen-Lenstra distribution. Koplewitz \cite{K} conjectured that for ran…
We study joint estimation of the inverse temperature and magnetization parameters $(β,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 the rate of consistency of the bi-variate pseudolikelihood estimator. Using this, we show that estimation at rate $n^{-1/2}$ is always possible if $A_n$ is the adjacency matrix of a bounded degree graph. If $A_n$ is the scaled adjacency matrix of a graph whose average degree goes to $+\infty$, the situation is a bit more delicate. In this case estimation at rat…
For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To obtain this result, we define the empirical bond distribution, which enumerates the number of bonds between a given couple of spins, and empirical spin distribution, which enumerates the number of sites having a given spin on the spinned random graphs. For these empirical distributions we extend the large deviation principle(LDP) to cover random graphs with co…
We analyse the metastable behaviour of the dilute Curie-Weiss model subject to a Glauber dynamics. The model is a random version of a mean-field Ising model, where the coupling coefficients are Bernoulli random variables with mean $p\in (0,1)$. This model can be also viewed as an Ising model on the Erdős-Rényi random graph with edge probability $p$. The system is a Markov chain where spins flip according to a Metropolis dynamics at inverse temperature $β$. We compute the average time the system takes to reach the stable phase when it starts from a certain probability distribution on the metast…
We investigate the effect of disorder on the Curie-Weiss model with Glauber dynamics. In particular, we study metastability for spin-flip dynamics on the Erdős-Rényi random graph $ER_n(p)$ with $n$ vertices and with edge retention probability $p \in (0,1)$. Each vertex carries an Ising spin that can take the values $-1$ or $+1$. Single spins interact with an external magnetic field $h \in (0,\infty)$, while pairs of spins at vertices connected by an edge interact with each other with ferromagnetic interaction strength $1/n$. Spins flip according to a Metropolis dynamics at inverse temperature …
Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Latała we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded derivatives of higher orders, which hold when the underlying measure satisfies a family of Sobolev type inequalities $\|g- \E g\|_p \le C(p)\|\nabla g\|_p.$ Such Sobolev type inequalities hold, e.g., if the underlying measure satisfies the log-Sobolev inequality (in which case $C(p) \le C\sqrt{p}$) or the Poincaré inequality (then $C(p) \le Cp$). Our concentration …
We consider the Ising model on a dense Erdős--Rényi random graph, $\mathcal G(N,p)$, with $p>0$ fixed---equivalently, a disordered Curie--Weiss Ising model with $\mbox{Ber}(p)$ couplings---at zero temperature. The disorder may induce local energy minima in addition to the two uniform ground states. In this paper we prove that, starting from a typical initial configuration, the zero-temperature dynamics avoids all such local minima and absorbs into a predetermined one of the two uniform ground states. We relate this to the local MINCUT problem on dense random graphs; namely with high probabilit…
The purpose of the present paper is to establish moment estimates of Rosenthal type for a rather general class of random variables satisfying certain bounds on the cumulants. We consider sequences of random variables which satisfy a central limit theorem and estimate the speed of convergence of the corresponding moments to the moments of a standard normally distributed variable. The examples of random objects we discuss include those where a dependency graphs or a weighted dependency graph encodes the dependency structure. We give applications to subgraph-counting statistics in Erdős-Rényi ran…
For Erdős-Rényi random graphs with average degree $γ$, and uniformly random $γ$-regular graph on $n$ vertices, we prove that with high probability the size of both the Max-Cut and maximum bisection are $n\Big(\fracγ{4} + {\sf P}_* \sqrt{\fracγ{4}} + o(\sqrtγ)\Big) + o(n)$ while the size of the minimum bisection is $n\Big(\fracγ{4}-{\sf P}_*\sqrt{\fracγ{4}} + o(\sqrtγ)\Big) + o(n)$. Our derivation relates the free energy of the anti-ferromagnetic Ising model on such graphs to that of the Sherrington-Kirkpatrick model, with ${\sf P}_* \approx 0.7632$ standing for the ground state energy of the l…
In this work we show that for every $d < \infty$ and the Ising model defined on $G(n,d/n)$, there exists a $β_d > 0$, such that for all $β< β_d$ with probability going to 1 as $n \to \infty$, the mixing time of the dynamics on $G(n,d/n)$ is polynomial in $n$. Our results are the first polynomial time mixing results proven for a natural model on $G(n,d/n)$ for $d > 1$ where the parameters of the model do not depend on $n$. They also provide a rare example where one can prove a polynomial time mixing of Gibbs sampler in a situation where the actual mixing time is slower than $n \polylog(n)$. Our…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding of ERGM, most notably in (Bhamidi, Bresler, Sly, 2011) through the analysis of a natural Heat-bath Glauber dynamics, and in (Chatterjee, Diaconis, 2013), (Eldan, Gross, 2018) via a large deviation theoretic perspective, several basic questions have remained unanswered owing to the lack of exact solvability unlike the much studied Curie-Weiss model (Ising mod…
