Related papers: Large deviations for marked sparse random graphs w…

We investigate the behavior of the empirical neighbourhood distribution of marked graphs in the framework of local weak convergence. We establish a large deviation principle for such families of empirical measures. The proof builds on…

This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…

For any finite colored graph we define the empirical neighborhood measure, which counts the number of vertices of a given color connected to a given number of vertices of each color, and the empirical pair measure, which counts the number…

We consider systems of mean-field interacting diffusions, where the pairwise interaction structure is described by a sparse (and potentially inhomogeneous) random graph. Examples include the stochastic Kuramoto model with pairwise…

We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…

We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…

We study the size of the largest biconnected components in sparse Erd\H{o}s-R\'enyi graphs with finite connectivity and Barab\'asi-Albert graphs with non-integer mean degree. Using a statistical-mechanics inspired Monte Carlo approach we…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

We study the exploration of an Erd\"os-R\'enyi random graph by a respondent-driven sampling method, where discovered vertices reveal their neighbours. Some of them receive coupons to reveal in their turn their own neighbourhood. This leads…

We prove limit theorems for systems of interacting diffusions on sparse graphs. For example, we deduce a hydrodynamic limit and the propagation of chaos property for the stochastic Kuramoto model with interactions determined by…

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]$,…

We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…

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\H{o}s-R{\' e}nyi random graphs by Chatterjee…

This paper investigate the sparse multi-type Erd\H{o}s R\'enyi random graphs studied in S\"{o}derberg~\cite{soderberg2002general} and also Bollob\'as et al.~\cite{bollobas2007phase}. Although the corresponding central limit results are…

In this article we find exponential good approximation of the empirical neigbourhood distribution of symbolled random graphs conditioned to a given empirical symbol distribution and empirical pair distribution. Using this approximation we…

Let $\Xi$ be the adjacency matrix of an Erd\H{o}s-R\'enyi graph on $n$ vertices and with parameter $p$ and consider $A$ a $n\times n$ centered random symmetric matrix with bounded i.i.d. entries above the diagonal. When the mean degree $np$…

We consider a mean-field system of path-dependent stochastic interacting diffusions in random media over a finite time window. The interaction term is given as a function of the empirical measure and is allowed to be non-linear and path…

Let $\mathcal{G}(N,\frac 1Nt_N)$ be the Erd\H{o}s-R\'enyi graph with connection probability $\frac 1Nt_N\sim t/N$ as $N\to\infty$ for a fixed $t\in(0,\infty)$. We derive a large-deviations principle for the empirical measure of the sizes of…

We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…

We find large deviation principles for the degree distribution and the proportion of isolated vertices for the near intermediate random geometric graph models on n vertices placed uniformly in [0, 1]^d, for d in N. In the course of the…