Related papers: Large Deviations for Weighted Sums of Stretched Ex…
Stretched exponential probability density functions (pdf), having the form of the exponential of minus a fractional power of the argument, are commonly found in turbulence and other areas. They can arise because of an underlying random…
Our work aims to study the tail behaviour of weighted sums of the form $\sum_{i=1}^{\infty} X_{i} \prod_{j=1}^{i}Y_{j}$, where $(X_{i}, Y_{i})$ are independent and identically distributed, with common joint distribution bivariate Sarmanov.…
Consider the upper tail probability that the homomorphism count of a fixed graph $H$ within a large sparse random graph $G_n$ exceeds its expected value by a fixed factor $1+\delta$. Going beyond the Erd\H{o}s-R\'enyi model, we establish…
In previous work Majda and McLaughlin computed explicit expressions for the $2N$th moments of a passive scalar advected by a linear shear flow in the form of an integral over ${\bf R}^N$. In this paper we first compute the asymptotics of…
The sums and maxima of weighted non-stationary random length sequences of regularly varying random variables may have the same tail and extremal indices, Markovich and Rodionov (2020). The main constraints are that there exists a unique…
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…
We study the lower tail large deviation problem for subgraph counts in a random graph. Let $X_H$ denote the number of copies of $H$ in an Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail…
Consider first passage percolation with identical and independent weight distributions and first passage time ${\rm T}$. In this paper, we study the upper tail large deviations $\mathbb{P}({\rm T}(0,nx)>n(\mu+\xi))$, for $\xi>0$ and $x\neq…
The asymptotic tail behaviour of sums of independent subexponential random variables is well understood, one of the main characteristics being the principle of the single big jump. We study the case of dependent subexponential random…
The big jump principle is a well established mathematical result for sums of independent and identically distributed random variables extracted from a fat tailed distribution. It states that the tail of the distribution of the sum is the…
A sum rule is an identity connecting the entropy of a measure with coefficients involved in the construction of its orthogonal polynomials (Jacobi coefficients). Our paper is an extension of Gamboa, Nagel and Rouault (2016), where we have…
We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving cut-off boundary at location n. Conditional on the sum being large at scale n, we show that a finite number of…
We prove a large deviation result for a random symmetric n x n matrix with independent identically distributed entries to have a few eigenvalues of size n. If the spectrum S survives when the matrix is rescaled by a factor of n, it can only…
The upper tail problem in a random graph asks to estimate the probability that the number of copies of some fixed subgraph in an Erd\H{o}s--R\'enyi random graph exceeds its expectation by some constant factor. There has been much exciting…
Accurate estimation of tail probabilities of projections of high-dimensional probability measures is of relevance in high-dimensional statistics and asymptotic geometric analysis. Whereas large deviation principles identify the asymptotic…
We consider random vectors $X$ that satisfy the equation in law $X=AX+B$, where $A$ is a given random diagonal matrix and $B$ a given random vector, both independent of $X$. It is well known by the works of Kesten and Goldie that the…
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…
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…
We derive in this short report the exponential as well as power decreasing tail estimations for the sums of centered exchangeable random variables, alike ones for the sums of the centered independent ones.
We consider the sums $S_n=\xi_1+\cdots+\xi_n$ of independent identically distributed random variables. We do not assume that the $\xi$'s have a finite mean. Under subexponential type conditions on distribution of the summands, we find the…