Universality properties of Gelfand-Tsetlin patterns
Anthony Metcalfe

TL;DR
This paper investigates the universal properties of Gelfand-Tsetlin patterns, especially their asymptotic behavior under certain conditions, linking them to free probability and determinantal point processes.
Contribution
It establishes a determinantal structure for Gelfand-Tsetlin patterns with unitarily invariant distributions and analyzes their asymptotic behavior using saddle point methods.
Findings
Derived the correlation kernel for a broad class of patterns.
Proved asymptotic convergence to the Sine kernel in certain regimes.
Connected the results to free probability theory.
Abstract
A standard Gelfand-Tsetlin pattern of depth is a configuration of particles in . For each , is referred to as the level of the pattern. A standard Gelfand-Tsetlin pattern has exactly particles on each level , and particles on adjacent levels satisfy an interlacing constraint. Probability distributions on the set of Gelfand-Tsetlin patterns of depth arise naturally as distributions of eigenvalue minor processes of random Hermitian matrices of size . We consider such probability spaces when the distribution of the matrix is unitarily invariant, prove a determinantal structure for a broad subclass, and calculate the correlation kernel. In particular we consider the case where the eigenvalues of the random matrix are fixed. This corresponds to choosing uniformly from the set of Gelfand-Tsetlin…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Point processes and geometric inequalities · Advanced Combinatorial Mathematics
