TY - JOUR

T1 - Fluctuations of interlacing sequences

AU - Sodin, Sasha

N1 - Publisher Copyright:
© Sasha Sodin, 2017.

PY - 2017

Y1 - 2017

N2 - In a series of works published in the 1990s, Kerov put forth various applications of the circle of ideas centered at the Markov moment problem to the limiting shape of random continual diagrams arising in representation theory and spectral theory. We demonstrate on several examples that his approach is also adequate to study the uctuations about the limiting shape. In the random matrix setting, we compare two continual diagrams: one is constructed from the eigenvalues of the matrix and the critical points of its characteristic polynomial, whereas the second one is constructed from the eigenvalues of the matrix and those of its principal submatrix. The uctuations of the latter diagram were recently studied by Erdős and Schröder; we discuss the uctuations of the former, and compare the two limiting processes. For Plancherel random partitions, the Markov correspondence establishes the equivalence between Kerov's central limit theorem for the Young diagram and the Ivanov-Olshanski central limit theorem for the transition measure. We outline a combinatorial proof of the latter, and compare the limiting process with the ones of random matrices.

AB - In a series of works published in the 1990s, Kerov put forth various applications of the circle of ideas centered at the Markov moment problem to the limiting shape of random continual diagrams arising in representation theory and spectral theory. We demonstrate on several examples that his approach is also adequate to study the uctuations about the limiting shape. In the random matrix setting, we compare two continual diagrams: one is constructed from the eigenvalues of the matrix and the critical points of its characteristic polynomial, whereas the second one is constructed from the eigenvalues of the matrix and those of its principal submatrix. The uctuations of the latter diagram were recently studied by Erdős and Schröder; we discuss the uctuations of the former, and compare the two limiting processes. For Plancherel random partitions, the Markov correspondence establishes the equivalence between Kerov's central limit theorem for the Young diagram and the Ivanov-Olshanski central limit theorem for the transition measure. We outline a combinatorial proof of the latter, and compare the limiting process with the ones of random matrices.

KW - Central limit theorem

KW - Continual diagrams

KW - Interlacing sequences

KW - Markov moment problem

KW - Random matrices

UR - http://www.scopus.com/inward/record.url?scp=85037359401&partnerID=8YFLogxK

U2 - 10.15407/mag13.04.364

DO - 10.15407/mag13.04.364

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85037359401

SN - 1812-9471

VL - 13

SP - 364

EP - 401

JO - Journal of Mathematical Physics, Analysis, Geometry

JF - Journal of Mathematical Physics, Analysis, Geometry

IS - 4

ER -