The Gelfand-Tsetlin graph and Markov processes

zbMATH Open1373.05203arXiv1404.3646MaRDI QIDQ4589013FDOQ4589013

Authors: G. I. Olshanskii 

Publication date: 6 November 2017

Abstract: The goal of the paper is to describe new connections between representation theory and algebraic combinatorics on one side, and probability theory on the other side. The central result is a construction, by essentially algebraic tools, of a family of Markov processes. The common state space of these processes is an infinite dimensional (but locally compact) space Omega. It arises in representation theory as the space of indecomposable characters of the infinite-dimensional unitary group U(infinity). Alternatively, Omega can be defined in combinatorial terms as the boundary of the Gelfand-Tsetlin graph --- an infinite graded graph that encodes the classical branching rule for characters of the compact unitary groups U(N). We also discuss two other topics concerning the Gelfand-Tsetlin graph: (1) Computation of the number of trapezoidal Gelfand-Tsetlin schemes (one could also say, the number of integral points in a truncated Gelfand-Tsetlin polytope). The formula we obtain is well suited for asymptotic analysis. (2) A degeneration procedure relating the Gelfand-Tsetlin graph to the Young graph by means of a new combinatorial object, the Young bouquet. At the end we discuss a few related works and further developments.

Full work available at URL: https://arxiv.org/abs/1404.3646

Recommendations

• Markov processes on the path space of the Gelfand-Tsetlin graph and on its boundary
• The boundary of the Gelfand-Tsetlin graph: A new approach
• Extended Gelfand-Tsetlin graph, its \(q\)-boundary, and \(q\)-B-splines
• The \(q\)-Gelfand-Tsetlin graph, Gibbs measures and \(q\)-Toeplitz matrices
• \(\mathfrak{sl}(2)\) operators and Markov processes on branching graphs

zbMATH Keywords

symmetric functionsinfinitesimal generatorsrepresentation ringGelfand-Tsetlin graphasymptotic representation theoryYoung graphFeller Markov processes

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Continuous-time Markov processes on discrete state spaces (60J27) Transition functions, generators and resolvents (60J35)

Cited In (8)

• Interlacing and smoothing: combinatorial aspects
• The boundary of the Gelfand-Tsetlin graph: A new approach
• Graph Laplace and Markov operators on a measure space
• Noncolliding Jacobi processes as limits of Markov chains on the Gelfand-Tsetlin graph
• Macdonald-level extension of beta ensembles and large-\(N\) limit transition
• The Young bouquet and its boundary
• Title not available (Why is that?)
• Vertex models, TASEP and Grothendieck polynomials

This page was built for publication: The Gelfand-Tsetlin graph and Markov processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589013)