Related papers: Upper tail bounds for stationary KPZ models
Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…
We consider the system of one-sided reflected Brownian motions which is in variational duality with Brownian last passage percolation. We show that it has integrable transition probabilities, expressed in terms of Hermite polynomials and…
Sums of independent, bounded random variables concentrate around their expectation approximately as well a Gaussian of the same variance. Well known results of this form include the Bernstein, Hoeffding, and Chernoff inequalities and many…
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…
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…
Let $\Psi_1,\Psi_2,...$ be a sequence of i.i.d. random Lipschitz functions on a complete separable metric space with unbounded metric $d$ and forward iterations $X_n$. Suppose that $X_n$ has a stationary distribution. We study the…
We formulate a uniform tail bound for empirical processes indexed by a class of functions, in terms of the individual deviations of the functions rather than the worst-case deviation in the considered class. The tail bound is established by…
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…
There is accumulating evidence in the literature that stability of learning algorithms is a key characteristic that permits a learning algorithm to generalize. Despite various insightful results in this direction, there seems to be an…
In this article we show how ideas, methods and results from optimal transportation can be used to study various aspects of the stationary measuresof Iterated Function Systems equipped with a probability distribution. We recover a classical…
For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…
In recent years, tensors have been applied to different applications in science and engineering fields. In order to establish theory about tail bounds of the tensors summation behavior, this work extends previous work by considering the…
Let $\{\xi_1,\xi_2,\ldots\}$ be a sequence of independent but not necessarily identically distributed random variables. In this paper, the sufficient conditions are found under which the tail probability…
We investigate a stationary random coefficient autoregressive process. Using renewal type arguments tailor-made for such processes, we show that the stationary distribution has a power-law tail. When the model is normal, we show that the…
In this paper, I present a completely new type of upper and lower bounds on the right-tail probabilities of continuous random variables with unbounded support and with semi-bounded support from the left. The presented upper and lower…
In this short note, we derive a precise tail expansion for Gaussian multiplicative chaos (GMC) associated to the 2d GFF on the unit disk with zero average on the unit circle (and variants). More specifically, we show that to first order the…
The extreme value theory is very popular in applied sciences including Finance, economics, hydrology and many other disciplines. In univariate extreme value theory, we model the data by a suitable distribution from the general max-domain of…
The upper tail problem in a sparse Erd\H{o}s-R\'enyi graph asks for the probability that the number of copies of some fixed subgraph exceeds its expected value by a constant factor. We study the analogous problem for oriented subgraphs in…
This article studies the temporal law of the KPZ fixed point. For the stationary geometry, we find the two-time law, which extends the single time law due to Baik-Rains and Ferrari-Spohn. For the droplet geometry, we find a relatively…
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)…