Related papers: Large deviations for macroscopic observables of he…
A basic result of large deviations theory is Sanov's theorem, which states that the sequence of empirical measures of independent and identically distributed samples satisfies the large deviation principle with rate function given by…
We prove a large deviation principle for stochastic differential equations driven by semimartingales, with additive controls. Conditions are given in terms of characteristics of driven semimartingales, so that if the noise-control pairs…
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…
To sample from a given target distribution, Markov chain Monte Carlo (MCMC) sampling relies on constructing an ergodic Markov chain with the target distribution as its invariant measure. For any MCMC method, an important question is how to…
Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail,…
We investigate an additive perturbation of a complex Wishart random matrix and prove that a large deviation principle holds for the spectral measures. The rate function is associated to a vector equilibrium problem coming from logarithmic…
We study a queueing network with a strictly upper-triangular routing matrix, where each column contains at most one non-negative entry, and the root node receives input from a spectrally positive L\'{e}vy process. Our aim is to characterize…
We consider fully connected and feedforward deep neural networks with dependent and possibly heavy-tailed weights, as introduced in [26], to address limitations of the standard Gaussian prior. It has been proved in [26] that, as the number…
The $W$-random graphs provide a flexible framework for modeling large random networks. Using the Large Deviation Principle (LDP) for $W$-random graphs from [9], we prove the LDP for the corresponding class of random symmetric…
We study random band matrices within the framework of traffic probability, an operadic non-commutative probability theory introduced by Male based on graph operations. As a starting point, we revisit the familiar case of the permutation…
Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…
Many solutions for scientific problems rely on finding the first (largest) eigenvalue and eigenvector of a particular matrix. We explore the distribution of the first eigenvector of a symmetric random sparse matrix. To analyze the…
We provide a perturbative expansion for the empirical spectral distribution of a Hermitian matrix with large size perturbed by a random matrix with small operator norm whose entries in the eigenvector basis of the first one are independent…
In this paper we study empirical measures which can be thought as a decoupled version of the empirical measures generated by random matrices. We prove the large deviation principle with the rate function, which is finite only on product…
Consider standard first-passage percolation on $\mathbb Z^d$. We study the lower-tail large deviations of the rescaled random metric $\widehat{\mathbf T}_n$ restricted to a box. If all exponential moments are finite, we prove that…
In this paper we study precise large deviations for the partial sums of a stationary sequence with a subexponential marginal distribution. Our main focus is on distributions which either have a regularly varying or a lognormal-type tail. We…
We present a large deviation principle at speed N for the largest eigenvalue of some additively deformed Wigner matrices. In particular this includes Gaussian ensembles with full-rank general deformation. For the non-Gaussian ensembles, the…
Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…
We prove large deviations principles for spectral measures of perturbed (or spiked) matrix models in the direction of an eigenvector of the perturbation. In each model under study, we provide two approaches, one of which relying on large…