English
Related papers

Related papers: Concentration inequalities for polynomials of cont…

200 papers

Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Lata{\l}a we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded…

Probability · Mathematics 2013-04-09 Radosław Adamczak , Paweł Wolff

We investigate the asymptotic behavior of probability measures associated with stochastic dynamical systems featuring either globally contracting or $B_{r}$-contracting drift terms. While classical results often assume constant diffusion…

Dynamical Systems · Mathematics 2025-05-14 Simone Betteti , Francesco Bullo

We present a concentration inequality for linear functionals of noncommutative polynomials in random matrices. Our hypotheses cover most standard ensembles, including Gaussian matrices, matrices with independent uniformly bounded entries…

Probability · Mathematics 2012-07-04 Mark W. Meckes , Stanislaw J. Szarek

We consider the relaxation time for the Glauber dynamics of infinite-volume critical ferromagnetic Ising model on $\Z^{d}$ in any dimension $d\geq2$. Under the assumptions regarding the finite-volume log-Sobolev constant and the 1-arm…

Probability · Mathematics 2025-05-19 Haoran Hu

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…

Probability · Mathematics 2013-10-22 Zakhar Kabluchko , Dmitry Zaporozhets

Many statistics of roots of random polynomials have been studied in the literature, but not much is known on the concentration aspect. In this note we present a systematic study of this question, aiming towards nearly optimal bounds to some…

Probability · Mathematics 2024-02-15 Ander Aguirre , Hoi H. Nguyen , Jingheng Wang

Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…

Probability · Mathematics 2013-07-30 Robin Pemantle , Yuval Peres

The classical Gaussian concentration inequality for Lipschitz functions is adapted to a setting where the classical assumptions (i.e. Lipschitz and Gaussian) are not met. The theory is more direct than much of the existing theory designed…

Probability · Mathematics 2022-05-16 Daniel J. Fresen

We establish concentration inequalities for random dynamical systems (RDSs), assuming that the observables of interest are separately Lipschitz. Under a weak average contraction condition, we obtain deviation bounds for several random…

Dynamical Systems · Mathematics 2026-03-24 Graccyela Salcedo

We give a simple development of the concentration properties of compound Poisson measures on the nonnegative integers. A new modification of the Herbst argument is applied to an appropriate modified logarithmic-Sobolev inequality to derive…

Probability · Mathematics 2024-05-07 I. Kontoyiannis , M. Madiman

For a wide class of monotonic functions $f$, we develop a Chernoff-style concentration inequality for quadratic forms $Q_f \sim \sum\limits_{i=1}^n f(\eta_i) (Z_i + \delta_i)^2$, where $Z_i \sim N(0,1)$. The inequality is expressed in terms…

Statistics Theory · Mathematics 2019-11-14 Robert E. Gallagher , Louis J. M. Aslett , David Steinsaltz , Ryan R. Christ

In this work we show that with high probability the chromatic number of a graph sampled from the random regular graph model $\Gnd$ for $d=o(n^{1/5})$ is concentrated in two consecutive values, thus extending a previous result of Achlioptas…

Combinatorics · Mathematics 2009-07-22 Sonny Ben-Shimon , Michael Krivelevich

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

Dynamical Systems · Mathematics 2016-03-18 Todor Bilarev , Magnus Aspenberg , Dierk Schleicher

This paper gives a review of concentration inequalities which are widely employed in non-asymptotical analyses of mathematical statistics in a wide range of settings, from distribution-free to distribution-dependent, from sub-Gaussian to…

Statistics Theory · Mathematics 2025-02-24 Huiming Zhang , Song Xi Chen

We analyze a plug-in estimator for a large class of integral functionals of one or more continuous probability densities. This class includes important families of entropy, divergence, mutual information, and their conditional versions. For…

Statistics Theory · Mathematics 2016-03-30 Shashank Singh , Barnabás P óczos

This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erd\"os-R\'enyi random…

Probability · Mathematics 2016-08-10 Can M. Le , Elizaveta Levina , Roman Vershynin

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 give an overview and extension of recent results on ergodic random Schr\"odinger operators for models on $\mathbb{Z}^d$. The operators we consider are defined on combinatorial or metric graphs, with random potentials, random boundary…

Mathematical Physics · Physics 2011-01-25 Michael J. Gruber , Daniel H. Lenz , Ivan Veselić

A metric probability space $(\Omega,d)$ obeys the ${\it concentration\; of\; measure\; phenomenon}$ if subsets of measure $1/2$ enlarge to subsets of measure close to 1 as a transition parameter $\epsilon$ approaches a limit. In this paper…

Probability · Mathematics 2024-08-07 Jonathan Root , Mark Kon

In this work we show that for every $d < \infty$ and the Ising model defined on $G(n,d/n)$, there exists a $\beta_d > 0$, such that for all $\beta < \beta_d$ with probability going to 1 as $n \to \infty$, the mixing time of the dynamics on…

Probability · Mathematics 2009-01-29 Elchanan Mossel , Allan Sly