Zeros of random orthogonal polynomials with complex Gaussian coefficients

Abstract

Let \fj\j=0n be a sequence of orthonormal polynomials where the orthogonality relation is satisfied on either the real line or on the unit circle. We study zero distribution of random linear combinations of the form Pn(z)=Σj=0nηjfj(z), where η0,…,ηn are complex-valued i.i.d.~standard Gaussian random variables. Using the Christoffel-Darboux formula, the density function for the expected number of zeros of Pn in these cases takes a very simple shape. From these expressions, under the mere assumption that the orthogonal polynomials are from the Nevai class, we give the limiting value of the density function away from their respective sets where the orthogonality holds. In the case when \fj\ are orthogonal polynomials on the unit circle, the density function shows that the expected number of zeros of Pn are clustering near the unit circle. To quantify this phenomenon, we give a result that estimates the expected number of complex zeros of Pn in shrinking neighborhoods of compact subsets of the unit circle.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…