English
Related papers

Related papers: Some notes on concentration for $\alpha$-subexpone…

200 papers

We provide a systematic approach to deal with the following problem. Let $X_1,\ldots,X_n$ be, possibly dependent, $[0,1]$-valued random variables. What is a sharp upper bound on the probability that their sum is significantly larger than…

Probability · Mathematics 2015-07-27 Christos Pelekis , Jan Ramon

Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…

Probability · Mathematics 2016-01-14 Sascha Bachmann

We show the equivalence of three properties for an infinitely divisible distribution: the subexponentiality of the density, the subexponentiality of the density of its L\'evy measure and the tail equivalence between the density and its…

Probability · Mathematics 2023-02-16 Muneya Matsui

We derive novel concentration inequalities for the operator norm of the sum of self-adjoint operators that do not explicitly depend on the underlying dimension of the operator, but rather an intrinsic notion of it. Our analysis leads to…

Statistics Theory · Mathematics 2026-02-17 Diego Martinez-Taboada , Aaditya Ramdas

We investigate concentration inequalities for Dirichlet and Multinomial random variables.

Machine Learning · Computer Science 2020-02-03 Jian Qian , Ronan Fruit , Matteo Pirotta , Alessandro Lazaric

We prove Fuk-Nagaev and Rosenthal-type inequalities for sums of independent random matrices, focusing on the situation when the norms of the matrices possess finite moments of only low orders. Our bounds depend on the ``intrinsic''…

Probability · Mathematics 2025-11-20 Moritz Jirak , Stanislav Minsker , Yiqiu Shen , Martin Wahl

This work shows how exponential concentration inequalities for additive functionals of stochastic processes over a finite time interval can be derived from concentration inequalities for martingales. The approach is entirely probabilistic…

Probability · Mathematics 2020-07-14 Bob Pepin

It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…

Probability · Mathematics 2021-01-26 Mohamed Slim Kammoun

In this paper we obtain some extensions of the classical Krylov-Safonov Harnack inequality. The novelty is that we consider functions that do not necessarily satisfy an infinitesimal equation but rather exhibit a two-scale behavior. We…

Analysis of PDEs · Mathematics 2018-03-28 Daniela De Silva , Ovidiu Savin

We investigate quantitative implications of the notion of log-concavity through a probabilistic interpretation. In particular, we derive concentration inequalities, moment and entropy bounds for random variables satisfying a precise degree…

Probability · Mathematics 2026-02-19 Arnaud Marsiglietti , James Melbourne

Recent development in high-dimensional statistical inference has necessitated concentration inequalities for a broader range of random variables. We focus on sub-Weibull random variables, which extend sub-Gaussian or sub-exponential random…

Statistics Theory · Mathematics 2023-02-28 Heejong Bong , Arun Kumar Kuchibhotla

We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for decomposable functions, improving Janson's Hoeffding-type…

Probability · Mathematics 2021-11-01 Rui-Ray Zhang

We prove sharp anti-concentration results for log-concave random variables on the real line in both the discrete and continuous setting. Our approach is elementary and uses majorization techniques to recover and extend some recent and not…

Probability · Mathematics 2025-05-12 Tulio Gaxiola , James Melbourne , Vincent Pigno , Emma Pollard

We obtain a number of new general properties, related to the closedness of the class of long-tailed distributions under convolutions, that are of interest themselves and may be applied in many models that deal with "plus" and/or "max"…

Probability · Mathematics 2015-11-24 Hui Xu , Sergey Foss , Yuebao Wang

Using the renewal approach we prove exponential inequalities for additive functionals and empirical processes of ergodic Markov chains, thus obtaining counterparts of inequalities for sums of independent random variables. The inequalities…

Probability · Mathematics 2013-10-18 Radosław Adamczak , Witold Bednorz

We provide an inequality which is a useful tool in studying both large deviation results and limit theorems for sums of random fields with "negligible" small values. In particular, the inequality covers cases of stable limits for random…

Probability · Mathematics 2017-09-06 Adam Jakubowski , Jan Rosiński

We investigate a way of comparing and classifying tails of random variables. Our approach extends the notion of classical indices, such as exponential and moment indices, which are widely used measuring heaviness of tail functions. A…

Probability · Mathematics 2013-10-07 Jaakko Lehtomaa

We obtain a Bernstein-type inequality for sums of Banach-valued random variables satisfying a weak dependence assumption of general type and under certain smoothness assumptions of the underlying Banach norm. We use this inequality in order…

Machine Learning · Statistics 2018-12-11 Gilles Blanchard , Oleksandr Zadorozhnyi

Random union sets $Z$ associated with stationary Poisson processes of $k$-cylinders in $\mathbb{R}^d$ are considered. Under general conditions on the typical cylinder base a concentration inequality for the volume of $Z$ restricted to a…

Probability · Mathematics 2019-08-07 Anastas Baci , Carina Betken , Anna Gusakova , Christoph Thaele

We establish a reversal of Lyapunov's inequality for monotone log-concave sequences, settling a conjecture of Havrilla-Tkocz and Melbourne-Tkocz. A strengthened version of the same conjecture is disproved through counter example. We also…

Information Theory · Computer Science 2021-11-16 James Melbourne , Gerardo Palafox-Castillo
‹ Prev 1 3 4 5 6 7 10 Next ›