Asymptotics of Traces of Paths in the Young and Schur Graphs
- 作者: Petrov F.V.1
-
隶属关系:
- St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University
- 期: 卷 240, 编号 5 (2019)
- 页面: 587-593
- 栏目: Article
- URL: https://journal-vniispk.ru/1072-3374/article/view/242796
- DOI: https://doi.org/10.1007/s10958-019-04377-9
- ID: 242796
如何引用文章
详细
Let G be a graded graph with levels V0, V1, . . .. Fix m and choose a vertex v in Vn where n ≥ m. Consider the uniform measure on the paths from V0 to v. Each such path has a unique vertex at the level Vm, so a measure \( {\nu}_v^m \) on Vm is induced. It is natural to expect that these measures have a limit as the vertex v goes to infinity in some “regular” way. We prove this (and compute the limit) for the Young and Schur graphs, for which regularity is understood as follows: the fraction of boxes contained in the first row and the first column goes to 0. For the Young graph, this was essentially proved by Vershik and Kerov in 1981; our proof is more straightforward and elementary.
作者简介
F. Petrov
St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University
编辑信件的主要联系方式.
Email: fedyapetrov@gmail.com
俄罗斯联邦, St. Petersburg
补充文件
