Related papers: Optimal tail comparison under convex majorization

A major issue of extreme value analysis is the determination of the shape parameter $\xi$ common to Generalized Extreme Value (GEV) and Generalized Pareto (GP) distributions, which drives the tail behavior, and is of major impact on the…

The non-asymptotic tail bounds of random variables play crucial roles in probability, statistics, and machine learning. Despite much success in developing upper bounds on tail probability in literature, the lower bounds on tail…

We derive sharp probability bounds on the tails of a product of symmetric non-negative random variables using only information about their first two moments. If the covariance matrix of the random variables is known exactly, these bounds…

We study the maximal correlation coefficient $R(X,Y)$ between two stochastic processes $X$ and $Y$. In the case when $(X,Y)$ is a random walk, we find $R(X,Y)$ using the Cs\'{a}ki-Fischer identity and the lower semicontinuity of the map…

The maximal (or Hilbertian) correlation coefficient between two random variables X and Y, denoted by \{X:Y\}, is the supremum of the |Corr(f(X),g(Y))| for real measurable functions f, g, where "Corr" denotes Pearson's correlation…

This paper considers estimation and inference about tail features when the observations beyond some threshold are censored. We first show that ignoring such tail censoring could lead to substantial bias and size distortion, even if the…

We study the sharp bounds of $\mathbb{E}[X_1\cdots X_d]$ when the univariate marginal distributions are known, but the dependence structure between them is unspecified. Maximizing products over non-negative variables is straightforward via…

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…

This work is devoted to a vast extension of Sanov's theorem, in Laplace principle form, based on alternatives to the classical convex dual pair of relative entropy and cumulant generating functional. The abstract results give rise to a…

We obtain concentration and large deviation for the sums of independent and identically distributed random variables with heavy-tailed distributions. Our concentration results are concerned with random variables whose distributions satisfy…

Based on a recent theorem due to the authors, it is shown how the extreme tail dependence between an asset and a factor or index or between two assets can be easily calibrated. Portfolios constructed with stocks with minimal tail dependence…

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

The aim of the paper is to show that the solutions to variational problems with non-standard growth conditions satisfy a corresponding variational inequality without any smallness assumptions on the gap between growth and coercitivity…

Heavy tailed phenomena are naturally analyzed by extreme value statistics. A crucial step in such an analysis is the estimation of the extreme value index, which describes the tail heaviness of the underlying probability distribution. We…

We provide bounds on the tail probabilities for simple procedures that generate random samples _without replacement_, when the probabilities of being selected need not be equal.

A survey is given of some Chernoff type bounds for the tail probabilities P(X-EX > a) and P(X-EX < a) when X is a random variable that can be written as a sum of indicator variables that are either independent or negatively related. Most…

It is well known that if a submartingale $X$ is bounded then the increasing predictable process $Y$ and the martingale $M$ from the Doob decomposition $% X=Y+M$ can be unbounded. In this paper for some classes of increasing convex functions…

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…

In this paper the following result, which allows one to decouple U-Statistics in tail probability, is proved in full generality. Theorem 1. Let $X_i$ be a sequence of independent random variables taking values in a measure space $S$, and…

We provide a generalisation of Pinelis' Rademacher-Gaussian tail comparison to complex coefficients. We also establish uniform bounds on the probability that the magnitude of weighted sums of independent random vectors uniform on Euclidean…