Related papers: Random vectors on the spin configuration of a Curi…
We analyze Ising/Curie-Weiss models on the (directed) Erd\H{o}s-R\'enyi 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…
We consider the dilute Curie-Weiss model of size $N$, which is a generalization of the classical Curie-Weiss model where the dependency structure between the spins is not encoded by the complete graph but via the (directed)…
We analyze Ising/Curie-Weiss models on the Erd\H{o}s-R\'enyi 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…
We discuss a Curie-Weiss model with two groups with different coupling constants within and between groups. For the total magnetisations in each group, we show bivariate laws of large numbers and a central limit theorem which is valid in…
In this paper, we consider the Ising model on random $d$-regular graphs (with $d\ge3$) and Erd\"os-R\'enyi graphs $G(n,d/n)$ (with $d>1$) at the critical temperature. We prove that the \textit{magnetization}, i.e.\ the sum of the spins of a…
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.…
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
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\H{o}s-R\'enyi random graph $ER_n(p)$ with $n$ vertices and with edge retention…
Ferromagnetic exponential random graph models (ERGMs) are nonlinear exponential tilts of Erd\H{o}s-R\'enyi models, under which the presence of certain subgraphs such as triangles may be emphasized. These models are mixtures of metastable…
We continue our analysis of Ising models on the (directed) Erd\H{o}s-R\'enyi 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.…
We obtain rates of convergence in limit theorems of partial sums $S_n$ for certain sequences of dependent, identically distributed random variables, which arise naturally in statistical mechanics, in particular, in the context of the…
What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
We model the transmission of information of a message on the Erd\"os-R\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a…
Enriquez, Faraud, and Lemaire (2023) have established process-level fluctuations for the giant of the dynamic Erd\H{o}s-R\'{e}nyi random graph above criticality and show that the limit is a centered Gaussian process with continuous sample…
We consider a class of particle systems described by differential equations (both stochastic and deterministic), in which the interaction network is determined by the realization of an Erd\H{o}s-R\'enyi graph with parameter $p_n\in (0, 1]$,…
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…