Random Bernstein-Markov factors
Igor Pritsker, Koushik Ramachandran

TL;DR
This paper investigates the behavior of Bernstein's inequality for random polynomials, revealing that the ratio of the norms of the derivative to the polynomial itself varies significantly from the classical bound, especially for different circle radii and norms.
Contribution
It provides new almost sure and expected bounds for the ratio of derivatives to polynomials in random settings, extending classical deterministic results.
Findings
For circles of radius less than one, the ratio is almost surely bounded as degree increases.
Expected ratio remains uniformly bounded under mild conditions on coefficients.
For radius greater than one, the ratio asymptotically equals n divided by the radius.
Abstract
For a polynomial of degree , Bernstein's inequality states that for all norms on the unit circle, with equality for We study this inequality for random polynomials, and show that the expected (average) and almost sure value of is often different from the classical deterministic upper bound . In particular, for circles of radii less than one, the ratio is almost surely bounded as tends to infinity, and its expected value is uniformly bounded for all degrees under mild assumptions on the random coefficients. For norms on the unit circle, Borwein and Lockhart mentioned that the asymptotic value of in probability is and we strengthen this to almost sure limit for If the radius of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
