Related papers: Large deviations for the largest singular value of…

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

We present detailed computations of the 'at least finite' terms (three dominant orders) of the free energy in a one-cut matrix model with a hard edge a, in beta-ensembles, with any polynomial potential. beta is a positive number, so not…

We consider a diffusion equation in $\mathbb{R}^d$ with drift equal to the gradient of a homogeneous potential of degree $1+\gamma$, with $0<\gamma<1$, and local variance equal to $\varepsilon^2$ with $\varepsilon\to 0$. The associated…

This paper studies probabilistic rates of convergence for consensus+innovations type of algorithms in random, generic networks. For each node, we find a lower and also a family of upper bounds on the large deviations rate function, thus…

We analyze the spectral properties of the high-dimensional random geometric graph $G(n, d, p)$, formed by sampling $n$ i.i.d vectors $\{v_i\}_{i=1}^{n}$ uniformly on a $d$-dimensional unit sphere and connecting each pair $\{i,j\}$ whenever…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster on $\Z^d$, $d\geq 2$.. We take the point of view of the moving particle and first prove a quenched LDP for the…

Chatteerjee and Diaconis have recently shown the asymptotic normality for the joint distribution of the number of descents and inverse descents in a random permutation. A noteworthy point of their results is that the asymptotic variance of…

Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…

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…

We present large deviations estimates in the supremum norm for a system of independent random walks superposed with a birth-and-death dynamics evolving on the discrete torus with $N$ sites. The scaling limit considered is the so-called…

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…

We study a class of interacting particle systems on $\mathbb{R}$ which was recently investigated by F. G\"otze and the second author [GV14]. These ensembles generalize eigenvalue ensembles of Hermitian random matrices by allowing different…

We study large deviations in the context of stochastic gradient descent for one-hidden-layer neural networks with quadratic loss. We derive a quenched large deviation principle, where we condition on an initial weight measure, and an…

In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial networks, and protein interaction networks, is…

Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…

We give abstract versions of the large deviation theorem for the distribution of zeros of polynomials and apply them to the characteristic polynomials of Hermitian random matrices. We obtain new estimates related to the local semi-circular…

The theorem of Furstenberg and Kesten provides a strong law of large numbers for the norm of a product of random matrices. This can be extended under various assumptions, covering nonnegative as well as invertible matrices, to a law of…

We consider the Gaussian beta-ensemble when $\beta$ scales with $n$ the number of particles such that $\displaystyle{{n}^{-1}\ll \beta\ll 1}$. Under a certain regime for $\beta$, we show that the largest particle satisfies a large…

We establish a large-deviations principle for the largest eigenvalue of a generalized sample covariance matrix, meaning a matrix proportional to $Z^T \Gamma Z$, where $Z$ has i.i.d. real or complex entries and $\Gamma$ is not necessarily…