English

Nearest neighbor Markov dynamics on Macdonald processes

Probability 2013-05-24 v1 Mathematical Physics Combinatorics math.MP Representation Theory

Abstract

Macdonald processes are certain probability measures on two-dimensional arrays of interlacing particles introduced by Borodin and Corwin (arXiv:1111.4408 [math.PR]). They are defined in terms of nonnegative specializations of the Macdonald symmetric functions and depend on two parameters (q,t), where 0<= q, t < 1. Our main result is a classification of continuous time, nearest neighbor Markov dynamics on the space of interlacing arrays that act nicely on Macdonald processes. The classification unites known examples of such dynamics and also yields many new ones. When t = 0, one dynamics leads to a new integrable interacting particle system on the one-dimensional lattice, which is a q-deformation of the PushTASEP (= long-range TASEP). When q = t, the Macdonald processes become the Schur processes of Okounkov and Reshetikhin (arXiv:math/0107056 [math.CO]). In this degeneration, we discover new Robinson--Schensted-type correspondences between words and pairs of Young tableaux that govern some of our dynamics.

Keywords

Cite

@article{arxiv.1305.5501,
  title  = {Nearest neighbor Markov dynamics on Macdonald processes},
  author = {Alexei Borodin and Leonid Petrov},
  journal= {arXiv preprint arXiv:1305.5501},
  year   = {2013}
}

Comments

90 pages; 13 figures

R2 v1 2026-06-22T00:21:32.128Z