arXiv Analytics

Sign in

arXiv:1901.07614 [math.PR]AbstractReferencesReviewsResources

A necessary and sufficient condition for global convergence of the complex zeros of random orthogonal polynomials

Duncan Dauvergne

Published 2019-01-22Version 1

Consider random polynomials of the form $G_n = \sum_{i=0}^n \xi_i p_i$, where the $\xi_i$ are i.i.d. non-degenerate complex random variables, and $\{p_i\}$ is a sequence of orthonormal polynomials with respect to a regular measure $\tau$ supported on a compact set $K$. We show that the normalized counting measure of the zeros of $G_n$ converges weakly almost surely to the equilibrium measure of $K$ if and only if $\mathbb E \log(1 + |\xi_0|) < \infty$. This generalizes the corresponding result of Ibragimov-Zaporozhets in the case when $p_i(z) = z^i$. We also show that the normalized counting measure of the zeros of $G_n$ converges weakly in probability to the equilibrium measure of $K$ if and only if $\mathbb P (|\xi_0| > e^n) = o(n^{-1})$. Our proofs rely on results from small ball probability and exploit the structure of general orthogonal polynomials. Our methods also work for sequences of asymptotically minimal polynomials in $L^p(\tau)$, where $p \in (0, \infty]$. In particular, sequences of $L^p$-minimal polynomials and (normalized) Faber and Fekete polynomials fall into this class.

Related articles: Most relevant | Search more
arXiv:2101.06727 [math.PR] (Published 2021-01-17)
Variance of real zeros of random orthogonal polynomials
arXiv:1507.01258 [math.PR] (Published 2015-07-05)
Expected number of real zeros for random orthogonal polynomials
arXiv:1801.10125 [math.PR] (Published 2018-01-30)
Universality for zeros of random polynomials