Jon Warren, Peter Windridge
We give examples of stochastic processes in the Gelfand Tsetlin cone in which each component evolves independently apart from a blocking and pushing interaction. The processes give couplings to certain conditioned Markov processes, last passage times and asymetric exclusion processes. An example of a cone valued process whose components cannot escape past a wall at the origin is also considered.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A standard Gelfand-Tsetlin pattern of depth $n$ is a configuration of particles in $\{1,...,n\} \times \R$. For each $r \in \{1,...,n\}$, $\{r\} \times \R$ is referred to as the $r^\text{th}$ level of the pattern. A standard Gelfand-Tsetlin pattern has exactly $r$ particles on each level $r$, and particles on adjacent levels satisfy an interlacing constraint. Probability distributions on the set of Gelfand-Tsetlin patterns of depth $n$ arise naturally as distributions of eigenvalue minor processes of random Hermitian matrices of size $n$. We consider such probability spaces when the distributi…
We introduce a stochastic dynamics related to the measures that arise in harmonic analysis on the infinite-dimensional unitary group. Our dynamics is obtained as a limit of a sequence of natural Markov chains on Gelfand-Tsetlin graph. We compute finite-dimensional distributions of the limit Markov process, the generator and eigenfunctions of the semigroup related to this process. The limit process can be identified with Doob h-transform of a family of independent diffusions. Space-time correlation functions of the limit process have a determinantal form.
The Gelfand-Tsetlin graph is an infinite graded graph that encodes branching of irreducible characters of the unitary groups. The boundary of the Gelfand-Tsetlin graph has at least three incarnations --- as a discrete potential theory boundary, as the set of finite indecomposable characters of the infinite-dimensional unitary group, and as the set of doubly infinite totally positive sequences. An old deep result due to Albert Edrei and Dan Voiculescu provides an explicit description of the boundary; it can be realized as a region in an infinite-dimensional coordinate space. The paper contains …
The macroscopic shape of Gelfand-Tsetlin patterns and free probability
研究盖尔芳德 - 采特林模式与自由概率，定义压缩熵\(\mathcal{H}[F]\)，证明相关等式，通过识别方程表明自由压缩达最大值，将模式视为界面模型计算表面张力，还证明特定模式满足大偏差原理，解决了相关猜想。
The Gelfand-Tsetlin graph and Markov processes
该研究构建了以Gelfand-Tsetlin图边界为状态空间的马尔可夫过程，建立表示论、组合学与概率论的新联系，并给出梯形Gelfand-Tsetlin格式计数公式及图的退化构造。
We construct a four-parameter family of Markov processes on infinite Gelfand-Tsetlin schemes that preserve the class of central (Gibbs) measures. Any process in the family induces a Feller Markov process on the infinite-dimensional boundary of the Gelfand-Tsetlin graph or, equivalently, the space of extreme characters of the infinite-dimensional unitary group U(infinity). The process has a unique invariant distribution which arises as the decomposing measure in a natural problem of harmonic analysis on U(infinity) posed in arXiv:math/0109193. As was shown in arXiv:math/0109194, this measure ca…
In the recent paper [arXiv:1109.1412], Borodin and Olshanski have presented a novel proof of the celebrated Edrei-Voiculescu theorem which describes the boundary of the Gelfand-Tsetlin graph as a region in an infinite-dimensional coordinate space. This graph encodes branching of irreducible characters of finite-dimensional unitary groups. Points of the boundary of the Gelfand-Tsetlin graph can be identified with finite indecomposable (= extreme) characters of the infinite-dimensional unitary group. An equivalent description identifies the boundary with the set of doubly infinite totally nonneg…
A continuation of the joint work by Vadim Gorin and the author, J. Funct. Anal. 270 (2016), 375-418; arXiv:1504.06832. The extended Gelfand-Tsetlin graph, introduced in that paper, is a novel combinatorial object. Its q-boundary is formed by infinite point configurations on a two-sided q-lattice. The q-boundary carries a continuous family of probability measures that are a q-analogue of the so-called zw-measures, which originated in the problem of harmonic analysis on the infinite-dimensional unitary group. In the present paper, it is proved that certain transition Markov kernels, linked to th…
Using Okounkov's $q$-integral representation of Macdonald polynomials we construct an infinite sequence $Ω_1,Ω_2,Ω_3,\dots$ of countable sets linked by transition probabilities from $Ω_N$ to $Ω_{N-1}$ for each $N=2,3,\dots$. The elements of the sets $Ω_N$ are the vertices of the extended Gelfand-Tsetlin graph, and the transition probabilities depend on the two Macdonald parameters, $q$ and $t$. These data determine a family of Markov chains, and the main result is the description of their entrance boundaries. This work has its origin in asymptotic representation theory. In the subsequent paper…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We obtain an explicit double contour integral expression for the determinantal correlation kernel of this ensemble (and also of its q-deformation). This provides new tools for asymptotic analysis of uniformly random lozenge tilings of polygons on the triangular lattice; or, equivalently, of random stepped surfaces. We work with a class of polygons which allows…
The problem of the description of finite factor representations of the infinite-dimensional unitary group, investigated by Voiculescu in 1976, is equivalent to the description of all totally positive Toeplitz matrices. Vershik-Kerov showed that this problem is also equivalent to the description of the simplex of central (i.e. possessing a certain Gibbs property) measures on paths in the Gelfand-Tsetlin graph. We study a quantum version of the latter problem. We introduce a notion of a q-centrality and describe the simplex of all q-central measures on paths in the Gelfand-Tsetlin graph. Conject…
The thesis focuses on processes on symplectic Gelfand-Tsetlin patterns. In chapter 4, a process with dynamics inspired by the Berele correspondence [Ber86] is presented. It is proved that the shape of the pattern is a Doob $h$-transform of independent random walks with $h$ given by the symplectic Schur function. This is followed by an extension to a $q$-weighted version. This randomised version has itself a branching structure and is related to a $q$-deformation of the $so_{2n+1}$-Whittaker functions. In chapter 5, we present a fully randomised process. This process $q$-deforms a process propo…
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}_n(\mathbb{C})$, ${\rm SO}_{2n+1}(\mathbb{C})$, ${\rm Sp}_{2n}(\mathbb{C})$, ${\rm SO}_{2n}(\mathbb{C})$ and the "non-classical" odd symplectic group ${\rm Sp}_{2n+1}(\mathbb{C})$, finding new connections to the probabilistic model of Last Passage Percolation (LPP). Perturbing the expressions of these characters as generating functions of Gelfand-Tsetlin patterns, we produce two families of symmetric polynomials that interpolate between characters of ${\rm Sp}_{2n}(\mathbb{C})$ and ${\rm SO}_{2n…
Gelfand-Tsetlin polytopes and random contractions away from the limiting shapes
研究全旗流形随机压缩下自伴矩阵极值特征值行为，等价于 Gelfand-Tsetlin 多胞体一致测度研究，获显式一致估计与离群行为指数小概率结论。
Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller Markov process. The dynamical correlation functions of the limit process are determinantal with an explicit correlation kernel. The key idea is to identify random point processes on Z with q-Gibbs measures on Gelfand-Tsetlin schemes and construct Markov processes on the latter space. Independently, we analyze the large time behavior of PushASEP with finitely ma…
We study the asymptotic behavior of a class of stochastic dynamics on interlacing particle configurations (also known as Gelfand-Tsetlin patterns). Examples of such dynamics include, in particular, a multi-layer extension of TASEP and particle dynamics related to the shuffling algorithm for domino tilings of the Aztec diamond. We prove that the process of reflected interlacing Brownian motions introduced by Warren in \cite{W} serves as a universal scaling limit for such dynamics.
We prove that the boundary of the Hall-Littlewood $t$-deformation of the Gelfand-Tsetlin graph is parametrized by infinite integer signatures, extending results of Gorin and Cuenca on boundaries of related deformed Gelfand-Tsetlin graphs. In the special case when $1/t$ is a prime $p$ we use this to recover results of Bufetov-Qiu and Assiotis on infinite $p$-adic random matrices, placing them in the general context of branching graphs derived from symmetric functions. Our methods rely on explicit formulas for certain skew Hall-Littlewood polynomials. As a separate corollary to these, we obtain …
We consider consistent diffusion dynamics, leaving the celebrated Hua-Pickrell measures, depending on a complex parameter $s$, invariant. These, give rise to Feller-Markov processes on the infinite dimensional boundary $Ω$ of the "graph of spectra", the continuum analogue of the Gelfand-Tsetlin graph, via the method of intertwiners of Borodin and Olshanski. In the particular case of $s=0$, this stochastic process is closely related to the $\mathsf{Sine_2}$ point process on $\mathbb{R}$ that describes the spectrum in the bulk of large random matrices. Equivalently, these coherent dynamics are a…
We construct discrete time Markov chains that preserve the class of Schur processes on partitions and signatures. One application is a simple exact sampling algorithm for q^{volume}-distributed skew plane partitions with an arbitrary back wall. Another application is a construction of Markov chains on infinite Gelfand-Tsetlin schemes that represent deterministic flows on the space of extreme characters of the infinite-dimensional unitary group.
We review some algebraic and combinatorial structures that underlie models in the KPZ universality class.Emphasis is placed on the Robinson-Schensted-Knuth correspondence and its geometric lifting due to A.N.Kirillov. We present how these combinatorial constructions are used to analyse the structure of solvable models in the KPZ class and lead to computation of their statistics via connecting to representation theoretic objects such as Schur, Macdonald and Whittaker functions, Young tableaux and Gelfand-Tsetlin patterns. We also present how fundamental representation theoretic concepts, such a…
We will introduce the notion of inductive limits of compact quantum groups as $W^*$-bialgebras equipped with some additional structures. We also formulate their unitary representation theories. Those give a more explicit representation-theoretic meaning to our previous study of quantized characters associated with a given inductive system of compact quantum groups. As a byproduct, we will give an explicit representation-theoretic interpretation to some transformations that play an important role in the analysis of $q$-central probability measures on the paths in the Gelfand-Tsetlin graph.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。