Related papers: Upper tails for arithmetic progressions in random …

We construct a new tail bound for the sum of independent random variables for situations in which the expected value of the sum is known and each random variable lies within a specified interval, which may be different for each variable.…

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

Finite sample properties of random covariance-type matrices have been the subject of much research. In this paper we focus on the "lower tail" of such a matrix, and prove that it is subgaussian under a simple fourth moment assumption on the…

We derive exponential tail inequalities for sums of random matrices with no dependence on the explicit matrix dimensions. These are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit…

We consider multivariate extreme value statistics for independent but nonidentically distributed random vectors. In particular, the data may have varying tail copulas and also heteroscedastic marginal distributions. Assuming smoothly…

We consider the tail distribution of the edge cover time of a specific non-Markov process, $\delta$ once-reinforced random walk, on finite connected graphs, whose transition probability is proportional to weights of edges. Here the weights…

We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…

Let $\mathrm{ex}(G_{n,p}^r,F)$ denote the maximum number of edges in an $F$-free subgraph of the random $r$-uniform hypergraph $G_{n,p}^r$, and let $s(F):=\sup\{s: \exists H,\ t_F(H)=t_{K_r^r}(H)^{s+e(F)}>0\}$. Following recent work of…

Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of…

We derive the tail inequalities between two random variables starting from inequalities between its moment, or more generally between its Lebesgue-Riesz norms, which holds true on certain sets of parameters. We consider some applications…

The task for a general and useful classification of the tail behaviors of probability distributions still has no satisfactory solution. Due to lack of information outside the range of the data the tails of the distribution should be…

There are many ways of measuring and modeling tail-dependence in random vectors: from the general framework of multivariate regular variation and the flexible class of max-stable vectors down to simple and concise summary measures like the…

We derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute…

At high levels, the asymptotic distribution of a stationary, regularly varying Markov chain is conveniently given by its tail process. The latter takes the form of a geometric random walk, the increment distribution depending on the sign of…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

We consider the upper and lower tail probabilities for the centered (by time$/24$) and scaled (according to KPZ time$^{1/3}$ scaling) one-point distribution of the Cole-Hopf solution of the KPZ equation when started with initial data drawn…

We consider sums of $n$ i.i.d. random variables with tails close to $\exp\{-x^\beta\}$ for some $\beta>1$. Asymptotics developed by Rootz\'en (1987) and Balkema, Kl\"uppelberg & Resnick (1993) are discussed from the point of view of tails…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

We present a proof of an upper tail bound of the correct order (up to a constant factor in the exponent) in two classes of stationary models in the KPZ universality class. The proof is based on an exponential identity due to Rains in the…

We give upper and lower asymptotic bounds for the left tail and for the right tail of the continuous limiting QuickSort density f that are nearly matching in each tail. The bounds strengthen results from a paper of Svante Janson (2015)…