Related papers: Nonlinear large deviations
This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…
We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…
We present a framework to calculate large deviations for nonlinear functions of independent random variables supported on compact sets in Banach spaces, by extending the result in Chatterjee and Dembo [6]. Previous research on nonlinear…
We prove general nonlinear large deviation estimates similar to Chatterjee-Dembo's original bounds except that we do not require any second order smoothness. Our approach relies on convex analysis arguments and is valid for a broad class of…
We prove lower large deviations for geometric functionals in sparse, critical and dense regimes. Our results are tailored for functionals with nonexisting exponential moments, for which standard large deviation theory is not applicable. The…
We present a general method to obtain the exact rate function $\Psi_{[a,b]}(k)$ controlling the large deviation probability $\text{Prob}[\mathcal{I}_N[a,b]=kN] \asymp e^{-N\Psi_{[a,b]}(k)}$ that a $N \times N$ sparse random matrix has…
We obtain error rates for large deviations of sums of i.i.d. random variables in, a particular case, of the domain of a non-symmetric infinite mean $\alpha=1$-stable law. The focus of this work is on the method of proof via analytic…
Nonlinear response occurs naturally when a strong perturbation takes a system far from equilibrium. Despite of its omnipresence in nanoscale systems, it is difficult to predict in a general and efficient way. Here we introduce a way to…
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…
In this paper we investigate the statistics of large waiting times (with respect to the total waiting time) for Bernoulli processes. We determine the corresponding rate functions explicitly and prove a large deviations asymptotic. By this…
This work develops a methodology for analyzing large-deviation lower tails associated with geometric functionals computed on a homogeneous Poisson point process. The technique applies to characteristics expressed in terms of stabilizing…
We characterize the sample size required for accurate graphical model selection from non-stationary samples. The observed data is modeled as a vector-valued zero-mean Gaussian random process whose samples are uncorrelated but have different…
We prove a large deviation principle for the greedy exploration of configuration models, building on a time-discretized version of the method proposed by Bermolen et al. and Brightwell et al. for jointly constructing a random graph from a…
We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…
We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper…
We present a large-deviations/thermodynamic approach to the classic problem of percolation on the complete graph. Specifically, we determine the large-deviation rate function for the probability that the giant component occupies a fixed…
In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…
Several approximate inference methods have been proposed for deep discrete latent variable models. However, non-parametric methods which have previously been successfully employed for classical sparse coding models have largely been…
Recent methods for estimating sparse undirected graphs for real-valued data in high dimensional problems rely heavily on the assumption of normality. We show how to use a semiparametric Gaussian copula--or "nonparanormal"--for high…
Large deviation functions contain information on the stability and response of systems driven into nonequilibrium steady states, and in such a way are similar to free energies for systems at equilibrium. As with equilibrium free energies,…