Related papers: Large Deviations for Random Trees
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…
Large-deviations theory deals with tails of probability distributions and the rare events of random processes, for example spreading packets of particles. Mathematically, it concerns the exponential fall-of of the density of thin-tailed…
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…
One of the main contributions of this paper is to illustrate how large deviation theory can be used to determine the equilibrium distribution of a basic droplet model that underlies a number of important models in material science and…
We analyze the \textit{Large Deviation Probability (LDP)} of linear factor models generated from non-identically distributed components with \textit{regularly-varying} tails, a large subclass of heavy tailed distributions. An efficient…
The study of two-dimensional Coulomb gases lies at the interface of statistical physics and non-Hermitian random matrix theory. In this paper we give a large deviation principle (LDP) for the empirical fields obtained, under the canonical…
We study right tail large deviations of the logarithm of the partition function for directed lattice paths in i.i.d. random potentials. The main purpose is the derivation of explicit formulas for the $1+1$-dimensional exactly solvable case…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…
We study the limiting degree distribution of the vertex splitting model introduced in \cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a…
We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.
We consider a multinomial distribution, where the number of cells increases and the cell-probabilities decreases as the number of observations grows. The probabilities of large deviations of statistics, which has form of a sum of Borel…
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…
Large deviation theory is a branch of probability theory that is devoted to a study of the "rate" at which empirical estimates of various quantities converge to their true values. The object of study in this paper is the rate at which…
We initiate a study of large deviations for block model random graphs in the dense regime. Following Chatterjee-Varadhan(2011), we establish an LDP for dense block models, viewed as random graphons. As an application of our result, we study…
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…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
We introduce a new family of models for growing networks. In these networks new edges are attached preferentially to vertices with higher number of connections, and new vertices are created by already existing ones, inheriting part of their…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
We consider temporal models of rapidly changing Markovian networks modulated by time-evolving spatially dependent kernels that define rates for edge formation and dissolution. Alternatively, these can be viewed as Markovian networks with…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…