Related papers: The Distributional Tail of Worst-Case Quickselect
Empirical distributions have their in-sample maxima as natural censoring. We look at the "hidden tail", that is, the part of the distribution in excess of the maximum for a sample size of $n$. Using extreme value theory, we examine the…
A common bottleneck in evaluating extremal performance measures is that, due to their very nature, tail data are often very limited. The conventional approach selects the best probability distribution from tail data using parametric…
Given any finite or countable collection of real numbers $T_j,j\in J$, we find all solutions $F$ to the stochastic fixed point equation \[W\stackrel{\mathrm {d}}{=}\inf_{j\in J}T_jW_j,\] where $W$ and the $W_j,j\in J$, are independent…
We study tail risk dynamics in high-frequency financial markets and their connection with trading activity and market uncertainty. We introduce a dynamic extreme value regression model accommodating both stationary and local unit-root…
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 in this article the asymptotic behavior as well as non-asymptotical estimates of tail of distribution for self-normalized sums of random variables (r.v.) under natural classical norming. We investigate also the case of…
We investigate the use of optimization to compute bounds for extremal performance measures. This approach takes a non-parametric viewpoint that aims to alleviate the issue of model misspecification possibly encountered by conventional…
Heavy-tailed distributions are infamously difficult to estimate because their moments tend to infinity as the shape of the tail decay increases. Nevertheless, this study shows the utilization of a modified group of moments for estimating a…
For multivariate distributions in the domain of attraction of a max-stable distribution, the tail copula and the stable tail dependence function are equivalent ways to capture the dependence in the upper tail. The empirical versions of…
Gradient clipping is a commonly used technique to stabilize the training process of neural networks. A growing body of studies has shown that gradient clipping is a promising technique for dealing with the heavy-tailed behavior that emerged…
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…
In this paper we revisited the classical problem of max-sum equivalence of randomly weighted sums in two dimensions. In opposite to the most papers in literature, we consider that there exists some interdependence between the primary random…
Let $(X_1,Y_1),\ldots,(X_n,Y_n)$ be an i.i.d. sample from a bivariate distribution function that lies in the max-domain of attraction of an extreme value distribution. The asymptotic joint distribution of the standardized component-wise…
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…
Standard statistical analysis is unable to provide reliable confidence intervals on expectation values of probability distributions that do not satisfy the conditions of the central limit theorem. We present a regression-based estimator of…
Let $T$ be the Student one- or two-sample $t$-, $F$-, or Welch statistic. Now release the underlying assumptions of normality, independence and identical distribution and consider a more general case where one only assumes that the vector…
We present a method for upper and lower bounding the right and the left tail probabilities of continuous random variables (RVs). For the right tail probability of RV $X$ with probability density function $f (x)$, this method requires first…
An algorithm for perfect simulation from the unique solution of the distributional fixed point equation $Y=_d UY + U(1-U)$ is constructed, where $Y$ and $U$ are independent and $U$ is uniformly distributed on $[0,1]$. This distribution…
We propose a mean functional which exists for any probability distributions, and which characterizes the Pareto distribution within the set of distributions with finite left endpoint. This is in sharp contrast to the mean excess plot which…
In a seminal paper Biggins and Kyprianou \cite{BKy04} proved the existence of a non degenerate limit for the {\it Derivative martingale} of the branching random walk. As shown in \cite{Aid11} and \cite{Mad11}, this is an object of central…