Random Tilings and Markov Chains for Interlacing Particles

被引:0
|
作者
Borodin, A. [1 ]
Ferrari, P. L. [2 ]
机构
[1] MIT, Dept Math, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] Univ Bonn, Inst Appl Math, Endenicher Allee 60, D-53115 Bonn, Germany
关键词
Markov chain; random tiling; shuffing algorithm; Schur process; LARGE TIME ASYMPTOTICS; DOMINO TILINGS; 6-VERTEX MODEL; GROWTH-MODELS; STATISTICS; BOUNDARY; PNG;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We explain the relation between certain random tiling models and interacting particle systems belonging to the anisotropic KPZ (Kardar - Parisi - Zhang) universality class in 2 + 1-dimensions. The link between these two a priori disjoint sets of models is a consequence of the presence of shuffing algorithms that generate random tilings under consideration. To see the precise connection, we represent both a random tiling and the corresponding particle system through a set of non-intersecting lines, whose dynamics is induced by the shuffing algorithm or the particle dynamics. The resulting class of measures on line ensembles also fits into the framework of the Schur processes.
引用
收藏
页码:419 / 451
页数:33
相关论文
共 50 条