相关论文: Nearly tight universal bounds for the binomial tai…

We consider the elliptic Ginibre ensembles in the real, complex and symplectic symmetry classes. As the matrix size tends to infinity, we derive the asymptotic behaviour of the upper tail large deviation probabilities for both the spectral…

For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials,…

We prove new lower bounds for the upper tail probabilities of suprema of Gaussian processes. Unlike many existing bounds, our results are not asymptotic, but supply strong information when one is only a little into the upper tail. We…

We give rates of convergence in the almost sure invariance principle for sums of dependent random variables with semi exponential tails, whose coupling coefficients decrease at a subexponential rate. We show that the rates in the strong…

We study deviation of U-statistics when samples have heavy-tailed distribution so the kernel of the U-statistic does not have bounded exponential moments at any positive point. We obtain an exponential upper bound for the tail of the…

In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…

The approach used by Kalashnikov and Tsitsiashvili for constructing upper bounds for the tail distribution of a geometric sum with subexponential summands is reconsidered. By expressing the problem in a more probabilistic light, several…

We study probability inequalities leading to tail estimates in a general semigroup $\mathscr{G}$ with a translation-invariant metric $d_{\mathscr{G}}$. (An important and central example of this in the functional analysis literature is that…

For a risk vector $V$, whose components are shared among agents by some random mechanism, we obtain asymptotic lower and upper bounds for the individual agents' exposure risk and the aggregated risk in the market. Risk is measured by…

The Markov, Chebyshev, and Chernoff inequalities are some of the most widely used methods for bounding the tail probabilities of random variables. In all three cases, the bounds are tight in the sense that there exists easy examples where…

We prove upper bounds on the transition probabilities of random walks with i.i.d. random conductances with a polynomial lower tail near $0$. We consider both constant and variable speed models. Our estimates are sharp. As a consequence, we…

In this paper, we develop a general theory on the coverage probability of random intervals defined in terms of discrete random variables with continuous parameter spaces. The theory shows that the minimum coverage probabilities of random…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Multivariate regular variation plays a role assessing tail risk in diverse applications such as finance, telecommunications, insurance and environmental science. The classical theory, being based on an asymptotic model, sometimes leads to…

We prove a Bernstein-type bound for the difference between the average of negative log-likelihoods of independent discrete random variables and the Shannon entropy, both defined on a countably infinite alphabet. The result holds for the…

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $\sigma$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf…

We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…

We investigate asymptotic behaviour of probabilities of large deviations for normalized combinatorial sums. We find a zone in which these probabilities are equivalent to the tail of the standard normal law. Our conditions are similar to the…

We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…

We extend known saddlepoint tail probability approximations to multivariate cases, including multivariate conditional cases. Our approximation applies to both continuous and lattice variables, and requires the existence of a cumulant…