Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Zeros of random orthogonal polynomials with complex Gaussian coefficients (1711.11178v2)

Published 30 Nov 2017 in math.CA and math.CV

Abstract: Let ${f_j}{j=0}n$ 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 $$P_n(z)=\sum{j=0}n\eta_jf_j(z),$$ where $\eta_0,\dots,\eta_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 $P_n$ 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 ${f_j}$ are orthogonal polynomials on the unit circle, the density function shows that the expected number of zeros of $P_n$ are clustering near the unit circle. To quantify this phenomenon, we give a result that estimates the expected number of complex zeros of $P_n$ in shrinking neighborhoods of compact subsets of the unit circle.

Summary

We haven't generated a summary for this paper yet.