Related papers: Large deviation principles for graphon sampling

We consider preferential attachment random graphs which may be obtained as follows: It starts with a single node. If a new node appears, it is linked by an edge to one or more existing node(s) with a probability proportional to function of…

The following question is due to Chatterjee and Varadhan (2011). Fix $0<p<r<1$ and take $G\sim G(n,p)$, the Erd\H{o}s-R\'enyi random graph with edge density $p$, conditioned to have at least as many triangles as the typical $G(n,r)$. Is $G$…

We consider large random trees under Gibbs distributions and prove a Large Deviation Principle (LDP) for the distribution of degrees of vertices of the tree. The LDP rate function is given explicitly. An immediate consequence is a Law of…

For parabolic stochastic partial differential equations (SPDEs), we show that the numerical methods, including the spatial spectral Galerkin method and further the full discretization via the temporal accelerated exponential Euler method,…

We establish the Level-1 and Level-3 Large Deviation Principles (LDPs) for invariant measures on shift spaces over finite alphabets under very general decoupling conditions for which the thermodynamic formalism does not apply. Such…

In this article for a finite typed random geometric graph we define the empirical locality distribution, which records the number of nodes of a given type linked to a given number of nodes of each type. We find large deviation principle…

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…

We prove a sample path large deviation principle (LDP) with sub-linear speed for unbounded functionals of certain Markov chains induced by the Lindley recursion. The LDP holds in the Skorokhod space $\mathbb{D}[0,T]$ equipped with the…

In this article, we prove a local large deviation principle (LLDP) for the empirical locality measure of typed random networks on $n$ nodes conditioned to have a given \emph{ empirical type measure} and \emph{ empirical link measure.} From…

We consider the moment space $\mathcal{M}_n^{K}$ corresponding to $p \times p$ complex matrix measures defined on $K$ ($K=[0,1]$ or $K=\D$). We endow this set with the uniform law. We are mainly interested in large deviations principles…

As an important tool characterizing the long time behavior of Markov processes, the Donsker-Varadhan LDP (large deviation principle) does not directly apply to distribution dependent SDEs/SPDEs since the solutions are non-Markovian. We…

We give a Large Deviation Principle (LDP) with explicit rate function for the distribution of vertex degrees in plane trees, a combinatorial model of RNA secondary structures. We calculate the typical degree distributions based on nearest…

In this article, we consider slow-fast McKean-Vlasov stochastic differential equations driven by Brownian motions and fractional Brownian motions. We give a definition of the large deviation principle (LDP) on the product space related to…

We prove a large-deviation principle (LDP) for the sample paths of jump Markov processes in the small noise limit when, possibly, all the jump rates vanish uniformly, but slowly enough, in a region of the state space. We further discuss the…

Using the weak convergence approach, we prove the large deviation principle (LDP) for solutions to quasilinear stochastic evolution equations with small Gaussian noise in the critical variational setting, a recently developed general…

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

Much work in the study of large deviations for random graph models is focused on the dense regime where the theory of graphons has emerged as a principal tool. These tools do not give a good approach to large deviation problems for random…

In this work, we study the large deviation properties of random walk in a random environment on $\mathbb{Z}^d$ with $d\geq1$. We start with the quenched case, take the point of view of the particle, and prove the large deviation principle…

We prove the the large deviation principle(LDP) for the law of the one-dimensional semilinear stochastic partial differential equations driven by nonlinear multiplicative noise. Firstly, combining the energy estimate and approximation…