2000 character limit reached
Concentration inequalities for the number of real zeros of Kac polynomials
Published 26 Nov 2023 in math.PR | (2311.15446v2)
Abstract: We study concentration inequalities for the number of real roots of the classical Kac polynomials $$f_{n} (x) = \sum_{i=0}n \xi_i xi$$ where $\xi_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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.