



























We study concentration inequalities for the number of real roots of the classical Kac polynomials $$f_{n} (x) = \sum_{i=0}^n ξ_i x^i$$ where $ξ_i$ are independent random variables with mean 0, variance 1, and uniformly bounded $(2+\ep_0)$-moments. We establish polynomial tail bounds, which are optimal, for the bulk of roots. For the whole real line, we establish sub-optimal tail bounds.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。