Related papers: Large deviation principles for graphon sampling

Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {P_n} be a sequence of transition matrices on a…

We prove large deviation principles (LDPs) for full chordal, radial, and multichordal SLE(0+) curves parameterized by capacity. The rate function is given by the appropriate variant of the Loewner energy. There are two key novelties in 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…

This work aims to prove the small time large deviation principle (LDP) for a class of stochastic partial differential equations (SPDEs) with locally monotone coefficients in generalized variational framework. The main result could be…

In this paper we develop the large deviations principle and a rigorous mathematical framework for asymptotically efficient importance sampling schemes for general, fully dependent systems of stochastic differential equations of slow and…

This paper is devoted to the problem of sample path large deviations for multidimensional queueing models with feedback. We derive a new version of the contraction principle where the continuous map is not well-defined on the whole space:…

Generalized Large deviation principles was developed for Colombeau-Ito SDE with a random coefficients. We is significantly expand the classical theory of large deviations for randomly perturbed dynamical systems developed by Freidlin and…

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…

We study two problems. First, we consider the large deviation behavior of empirical measures of certain diffusion processes as, simultaneously, the time horizon becomes large and noise becomes vanishingly small. The law of large numbers…

In this work, we establish the Freidlin--Wentzell large deviations principle (LDP) of the stochastic Cahn--Hilliard equation with small noise, which implies the one-point LDP. Further, we give the one-point LDP of the spatial finite…

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 a system of stochastic interacting particles in $\mathbb{R}^d$ and we describe large deviations asymptotics in a joint mean-field and small-noise limit. Precisely, a large deviations principle (LDP) is established for the…

We show some level-2 large deviation principles for real and complex one-dimensional maps satisfying a weak form of hyperbolicity. More precisely, we prove a large deviation principle for the distribution of iterated preimages, periodic…

In this paper, we first study the large deviation principle (LDP) for non-degenerate McKean-Vlasov stochastic differential equations (MVSDEs) with H\"{o}lder continuous drifts by using Zvonkin's transformation. When the drift only satisfies…

We study sample-path large deviations for L\'evy processes and random walks with heavy-tailed jump-size distributions that are of Weibull type. Our main results include an extended form of an LDP (large deviations principle) in the $J_1$…

We prove a sample path Large Deviation Principle (LDP) for a class of jump processes whose rates are not uniformly Lipschitz continuous in phase space. Building on it we further establish the corresponding Wentzell-Freidlin (W-F) (infinite…

We consider the Markovian supermarket model with growing choices, where jobs arrive at rate $n\lambda_n$ and each of $n$ parallel servers processes jobs in its queue at rate $1$. Each incoming job joins the shortest among $d_n \in…

In this article, we prove Shannon-MacMillan-Breiman Theorem for Wireless Sensor Networks modelled as coloured geometric random graphs. For large $n,$ we show that a Wireless Sensor Network consisting of $n$ sensors in $[0,1]^d$ connected by…

Block graphons (also called stochastic block models) are an important and widely-studied class of models for random networks. We provide a lower bound on the accuracy of estimators for block graphons with a large number of blocks. We show…

We study large deviation principles for Gaussian processes lifted to the free nilpotent group of step N. We apply this to a large class of Gaussian processes lifted to geometric rough paths. A large deviation principle for enhanced…