相关论文: Large deviation principles for empirical measures …

We consider large deviations of empirical measures of diffusion processes. In a first part, we present conditions to obtain a large deviations principle (LDP) for a precise class of unbounded functions. This provides an analogue to the…

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

In this paper we introduce a topology under which the pair empirical measure of a large class of random walks satisfies a strong Large Deviation principle. The definition of the topology is inspired by the recent article by Mukherjee and…

We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…

In this article, we prove a joint large deviation principle in $n$ for the \emph{empirical pair measure} and \emph{ empirical offspring measure} of critical multitype Galton-Watson trees conditioned to have exactly $n$ vertices in the weak…

We consider a family of positive operator valued measures associated with representations of compact connected Lie groups. For many independent copies of a single state and a tensor power representation we show that the observed probability…

The purpose of the present paper is to establish moderate deviation principles for a rather general class of random variables fulfilling certain bounds of the cumulants. We apply a celebrated lemma of the theory of large deviations…

For fitness preferential attachment random networks, we define the empirical degree and pair measure, which counts the number of vertices of a given degree and the number of edges with given fits, and the sample path empirical degree…

In this article we show that the empirical measure of certain continuous time random walks satisfies a strong large deviation principle with respect to a topology introduced in~\cite{MV2016} by Mukherjee and Varadhan. This topology is…

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

This paper deals with rare events in a general {interacting gas} at high temperature, by means of Large Deviations Principles. The main result is an LDP for the tagged empirical field, which features the competition of an energy term and an…

We study the near-critical behavior of the sparse Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$ on $n\gg1$ vertices, where the connection probability $p$ satisfies $np = 1+\theta(b_n^2/n)^{1/3}$, with $n^{3/10}\ll {b_n}\ll n^{1/2}$, and…

Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…

Borgs, Chayes, Gaudio, Petti and Sen [arXiv:2007.14508] proved a large deviation principle for block model random graphs with rational block ratios. We strengthen their result by allowing any block ratios (and also establish a simpler…

In a series of two papers, we investigate the large deviations and asymptotic behavior of stochastic models of brain neural networks with random interaction coefficients. In this first paper, we take into account the spatial structure of…

We study the stochastic block model which is often used to model community structures and study community-detection algorithms. We consider the case of two blocks in regard to its largest connected component and largest biconnected…

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…

The large deviation principle is proved for a class of $L^2$-valued processes that arise from the coarse-graining of a random field. Coarse-grained processes of this kind form the basis of the analysis of local mean-field models in…

One of the first steps in applications of statistical network analysis is frequently to produce summary charts of important features of the network. Many of these features take the form of sequences of graph statistics counting the number…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…