Related papers: Large deviations for the leaves in some random tre…
We prove a large deviations principle for the empirical law of the block sizes of a uniformly distributed non-crossing partition. As an application we obtain a variational formula for the maximum of the support of a compactly supported…
In this paper, we study the large deviation principle (LDP) for two types (Type I and Type II) of multiplicative Ising models. For Types I and II, the explicit formulas for the free energy functions and the associated rate functions are…
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…
We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…
The purpose of this paper is to ensure the conditions of G\"artner-Ellis Theorem for evaluations of the empirical measure. We show that up-to-date conditions for ensuring the convergence to a quasi-stationary distribution can be applied…
It is well-known that large deviations of random walks driven by independent and identically distributed heavy-tailed random variables are governed by the so-called principle of one large jump. We note that further subtleties hold for such…
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be…
We introduce two models for multi-type random trees motivated by studies of trait dependence in the evolution of species. Our discrete time model, the multi-type ERM tree, is a generalization of Markov propagation models on a random tree…
Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
The large deviation principle in the small noise limit is derived for solutions of possibly degenerate It\^o stochastic differential equations with predictable coefficients, which may depend also on the large deviation parameter. The result…
We propose a computational method for large deviation statistics of time-averaged quantities in general Markov processes. In our proposed method, we repeat a response measurement against external forces, where the forces are determined by…
In contrast to the study of Langevin equations in a homogeneous environment in the literature, the study on Langevin equations in randomly-varying environments is relatively scarce. Almost all the existing works require random environments…
Multivariate extreme value distributions are a common choice for modelling multivariate extremes. In high dimensions, however, the construction of flexible and parsimonious models is challenging. We propose to combine bivariate max-stable…
We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are…
We present an analytical technique to compute the probability of rare events in which the largest eigenvalue of a random matrix is atypically large (i.e.\ the right tail of its large deviations). The results also transfer to the left tail…
The so-called 'Level 2.5' general result for the large deviations of the joint probability of the density and of the currents for Markov Jump processes is applied to the case of $N$ independent particles on a ring with random transition…
Modern risk modelling approaches deal with vectors of multiple components. The components could be, for example, returns of financial instruments or losses within an insurance portfolio concerning different lines of business. One of the…
The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…
Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…