On random polynomials generated by a symmetric three-term recurrence relation
Abstract
We investigate the sequence (Pn(z))n=0∞ of random polynomials generated by the three-term recurrence relation Pn+1(z)=z Pn(z)-an Pn-1(z), n≥ 1, with initial conditions P(z)=z, =0, 1, assuming that (an)n∈Z is a sequence of positive i.i.d. random variables. (Pn(z))n=0∞ is a sequence of orthogonal polynomials on the real line, and Pn is the characteristic polynomial of a Jacobi matrix Jn. We investigate the relation between the common distribution of the recurrence coefficients an and two other distributions obtained as weak limits of the averaged empirical and spectral measures of Jn. Our main result is a description of combinatorial relations between the moments of the aforementioned distributions in terms of certain classes of colored planar trees. Our approach is combinatorial, and the starting point of the analysis is a formula of P. Flajolet for weight polynomials associated with labelled Dyck paths.
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.