English
Related papers

Related papers: Concentration inequalities for polynomials in $\al…

200 papers

The Hanson-Wright inequality is an upper bound for tails of real quadratic forms in independent random variables. In this work, we extend the Hanson-Wright inequality for the Ky Fan k-norm for the polynomial function of the quadratic sum of…

Probability · Mathematics 2022-03-02 Shih Yu Chang

In this work we provide performance guarantees for hypocoercive non-reversible MCMC samplers $X_t$ with invariant measure $\mu_*$; our results apply in particular to the Langevin equation, Hamiltonian Monte-Carlo, and the bouncy particle…

Probability · Mathematics 2025-10-13 Jeremiah Birrell , Luc Rey-Bellet

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

We develop concentration inequalities for the $l_\infty$ norm of vector linear processes with sub-Weibull, mixingale innovations. This inequality is used to obtain a concentration bound for the maximum entrywise norm of the lag-$h$…

Statistics Theory · Mathematics 2024-10-18 Eduardo Fonseca Mendes , Fellipe Lopes

Let $X,X_1,...,X_n$ be independent identically distributed random variables. The paper deals with the question about the behavior of the concentration function of the random variable $\sum_{k=1}^{n}a_k X_k$ according to the arithmetic…

Probability · Mathematics 2014-01-07 Yu. S. Eliseeva , A. Yu. Zaitsev

Based on the multivariate saddle point method we study the asymptotic behavior of the characteristic polynomials associated to Wishart type random matrices that are formed as products consisting of independent standard complex Gaussian and…

Classical Analysis and ODEs · Mathematics 2014-07-11 Thorsten Neuschel , Dries Stivigny

A set of high dimensional points $X=\{x_1, x_2,\ldots, x_n\} \subset R^d$ in isotropic position is said to be $\delta$-anti concentrated if for every direction $v$, the fraction of points in $X$ satisfying $|\langle x_i,v \rangle |\leq…

Data Structures and Algorithms · Computer Science 2024-10-29 Ainesh Bakshi , Pravesh Kothari , Goutham Rajendran , Madhur Tulsiani , Aravindan Vijayaraghavan

We give Hoeffding and Bernstein-type concentration inequalities for the largest eigenvalue of sums of random matrices arising from a Markov chain. We consider time-dependent matrix-valued functions on a general state space, generalizing…

Probability · Mathematics 2025-07-01 Joe Neeman , Bobby Shi , Rachel Ward

The matrix Markov inequality by Ahlswede was stated using the Loewner anti-order between positive definite matrices. Wang use this to derive several other Chebyshev and Chernoff-type inequalities (Hoeffding, Bernstein, empirical Bernstein)…

Probability · Mathematics 2024-08-14 Reihaneh Malekian , Aaditya Ramdas

We show how to extend several basic concentration inequalities for simple random tensors $X = x_1 \otimes \cdots \otimes x_d$ where all $x_k$ are independent random vectors in $\mathbb{R}^n$ with independent coefficients. The new results…

Probability · Mathematics 2025-10-07 Roman Vershynin

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for…

Information Theory · Computer Science 2010-10-21 Oliver Johnson , Yaming Yu

If a random variable is not exponentially integrable, it is known that no concentration inequality holds for an infinite sequence of independent copies. Under mild conditions, we establish concentration inequalities for finite sequences of…

Probability · Mathematics 2007-05-23 Franck Barthe , Patrick Cattiaux , Cyril Roberto

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

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

Probability · Mathematics 2016-08-11 V. Yu. Korolev , A. V. Dorofeeva

We present a proof of the concentration inequality for a discrete random surface model, where the underlying potential is perturbed by an additive random potential. The proof is based on annealing the random potential, and follows the…

Probability · Mathematics 2021-11-12 Andrew Krieger

We show that any probability measure satisfying a Matrix Poincar\'e inequality with respect to some reversible Markov generator satisfies an exponential matrix concentration inequality depending on the associated matrix carr\'e du champ…

Probability · Mathematics 2020-06-02 Richard Aoun , Marwa Banna , Pierre Youssef

New Vapnik and Chervonenkis type concentration inequalities are derived for the empirical distribution of an independent random sample. Focus is on the maximal deviation over classes of Borel sets within a low probability region. The…

Statistics Theory · Mathematics 2022-04-26 Stéphane Lhaut , Anne Sabourin , Johan Segers

Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. The paper deals with the question about the behavior of the concentration function of the random variable $\sum\limits_{k=1}^{n}X_k a_k$ according to the…

Probability · Mathematics 2013-03-19 Yu. S. Eliseeva

This paper develops Kolmogorov-type maximal inequalities for sums of Negative Binomial random variables under both independence and dependence structures. For independent heterogeneous Negative Binomial variables we derive sharp Markov-type…

Statistics Theory · Mathematics 2026-03-23 Aristides V. Doumas , S. Spektor

Concentration results and probabilistic analysis for combinatorial problems like the TSP, MWST, graph coloring have received much attention, but generally, for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example).…

Probability · Mathematics 2010-05-24 Ravindran Kannan