This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

The inhomogeneous multispecies PushTASEP: Dynamics and symmetry

Arvind Ayyer Arvind Ayyer, Department of Mathematics, Indian Institute of Science, Bangalore 560012, India. [email protected]  and  James B. Martin James B. Martin, Department of Statistics, University of Oxford, UK [email protected]
Abstract.

We introduce and study a natural multispecies variant of the inhomogeneous PushTASEP with site-dependent rates on the finite ring. We show that the stationary distribution of this process is proportional to the ASEP polynomials at q=1q=1 and t=0t=0. This is done by constructing a multiline process which projects to the multispecies PushTASEP, and identifying its stationary distribution using time-reversal arguments. We also study symmetry properties of the process under interchange of the rates associated to the sites. These results hold not just for events depending on the configuration at a single time in stationarity, but also for systems out of equilibrium and for events depending on the path of the process over time. Lastly, we give explicit formulas for nearest-neighbour two-point correlations in terms of Schur functions.

Key words and phrases:
PushTASEP, multispecies, inhomogeneous, multiline, TASEP, interchangeability
2010 Mathematics Subject Classification:
60J10, 82B20, 82B23, 82B44, 33D52, 05A10

1. Introduction

The multispecies asymmetric simple exclusion process (ASEP) is an interacting particle system originating in statistical mechanics and probability, with significant connections to different areas of mathematics such as combinatorics and representation theory. It has been the focus of considerable study in the last few decades. The stationary distribution of the multispecies TASEP (i.e. ASEP with asymmetry parameter t=0t=0) on a ring of size nn was described by Ferrari and Martin [ferrari-martin-2007] in terms of multiline diagrams. The connection between the multispecies ASEP with content λ\lambda and the Macdonald polynomial Pλ(x1,,xn;q,t)P_{\lambda}(x_{1},\dots,x_{n};q,t) was realised by Cantini–de Gier–Wheeler [cantini-degier-wheeler-2015] and by Chen–de Gier–Wheeler [chen-degier-wheeler-2020]. In these works, they define ASEP polynomials (which are called relative Macdonald polynomials in [guo-ram-2021], and which are special cases of the permuted basement Macdonald polynomials studied in [ferreira-2011, alexandersson-2019]). These are polynomials in variables x1,,xnx_{1},\dots,x_{n} whose coefficients are rational functions in q,tq,t, which, for q=1q=1 and all xix_{i} equal, are proportional to the stationary distribution of the multispecies ASEP. Later on, Corteel–Mandelshtam–Williams [corteel-mandelshtam-williams-2022] showed that the ASEP polynomials can be computed using the multiline diagrams stated above by assigning a weight depending on q,tq,t and the variables x1,,xnx_{1},\dots,x_{n}.

The ASEP itself is not thought to have nice algebraic properties when the jump rates are allowed to differ between sites – but it is natural to ask if there is some multispecies particle system with site-wise inhomogeneity whose stationary distribution is proportional to the ASEP polynomial at q=1q=1 for general values of the parameters x1,,xnx_{1},\dots,x_{n}.

In this and a companion paper [ayyer-martin-williams-2024], we show that this is indeed the case, for a multispecies inhomogeneous version of the PushTASEP, with deformation parameter t0t\geq 0. The case of general tt is covered in [ayyer-martin-williams-2024]. In this work, we focus on various interesting aspects of the particular case t=0t=0.

The arguments in [ayyer-martin-williams-2024] involve developing relationships between the ASEP polynomials and the non-symmetric Macdonald polynomials. Here for the case t=0t=0, we explain an alternative proof of a different nature, constructing a Markov chain on multiline diagrams whose bottom row projects to the PushTASEP process, and whose stationary distribution is proportional to the weight defined in [corteel-mandelshtam-williams-2022]. This extends the approach of [ferrari-martin-2006] to the inhomogeneous setting.

A particular focus is on symmetry properties under interchange of the rates between different sites. We show that probabilities of events depending on a given interval of sites remain unchanged when the rates at other sites are permuted. Such results are proved for the general case t0t\geq 0 in [ayyer-martin-williams-2024], for events depending on the configuration at a single time in the stationary distribution. In the special case t=0t=0 we can prove significantly stronger properties, applying to systems out of equilibrium, and to events which depend not just on a single time but on the path of an evolving process. These results are obtained by using coupling methods to prove interchangeability results for PushTASEP stations analogous to those previously proved for exponential queueing servers [Weber1979, TsoucasWalrand1987, MartinPrabhakar2010].

Finally we study various observables for the system in stationary, such as the density of particles of a given species at a given site, and the current between sites for particles of a given species. We give explicit formulas for nearest-neighbour two-point correlations in terms of Schur functions.

The PushTASEP, although somewhat less widely known than its cousin the TASEP, has nonetheless been widely studied in recent years. Spitzer [spitzer-1970] introduced it as an example of a long-range exclusion process, but more recently the name PushTASEP has become established. It has often been studied on the infinite lattice \mathbb{Z} – see for example [petrov-2020] for extensive references – but there have been a few studies on finite graphs as well [ayyer_schilling_steinberg_thiery.sandpile.2013, ayyer-2016]. The multispecies case was already considered in [ferrari-martin-2006], under the guise of the discrete-space Hammersley–Aldous–Diaconis process, to which it is equivalent by particle-hole duality. A related multispecies process in discrete time (dubbed the “frog model”) was recently used by Bukh–Cox [bukh-cox-2022] to study problems involving the longest common subsequence between a periodic word and a word with i.i.d. uniform entries. For an inhomogeneous version on the line, limit shape and fluctuation results are obtained by Petrov [petrov-2020]. The multispecies inhomogeneous model with t>0t>0 was studied on an open interval by Borodin and Wheeler [borodin-wheeler-2022, Section 12.5].

As this project was being completed, related work by Aggarwal, Nicoletti and Petrov appeared [aggarwal-nicoletti-petrov-2023], which studies an inhomogeneous ttPushTASEP on the ring (in fact, a more general model in which the sites can have capacities greater than 11). They obtain a description of the stationary distribution of such systems in terms of “queue vertex models” on the cylinder – these objects are closely related to multiline diagrams (and to matrix product formulae). Their methods are very different to ours, making extensive use of the Yang-Baxter equation.

1.1. Main results

We now describe the model we study, an inhomogeneous PushTASEP on a ring of size nn, with ss species of particle (called 1,2,,s1,2,\dots,s).

We start with the single species case, i.e. s=1s=1. Each site contains either a single particle of type 11, or a vacancy. The number of particles will be conserved by the dynamics – write m1m_{1} for the number of particles, and m0:=nm1m_{0}:=n-m_{1} for the number of vacancies. Then a configuration η=(ηj,1jn)\eta=(\eta_{j},1\leq j\leq n) is a tuple of length nn containing m1m_{1} 11s and m0m_{0} 0s, where ηi=1\eta_{i}=1 if the configuration has a particle at ii.

We have positive real parameters x1,,xnx_{1},\dots,x_{n}, which we think of as attached to the sites 1,2,,n1,2,\dots,n. The system is a Markov chain whose rates can be described as follows. At each site jj, a bell rings at rate 1/xj1/x_{j}. When this bell rings, if jj is vacant, nothing changes. If jj is occupied by a particle, that particle moves to the first vacant site clockwise from jj, leaving a vacancy at jj itself.

Now we move to the general case of ss species. We denote ηj=r\eta_{j}=r if the configuration η\eta has a particle of type rr at site jj, where 1rs1\leq r\leq s, and ηj=0\eta_{j}=0 if site jj is vacant. The number of particles of each type will be conserved by the dynamics: write mrm_{r} for the number of particles of species rr for 1rs1\leq r\leq s – now the number of vacancies is m0=nr=1smrm_{0}=n-\sum_{r=1}^{s}m_{r}.

Equivalently we can describe the particle content as a partition (i.e. a weakly decreasing tuple of non-negative integers) of length nn, given by

λ=(s,,sms,,1,,1m1,0,,0m0),\lambda=(\underbrace{s,\dots,s}_{m_{s}},\dots,\underbrace{1,\dots,1}_{m_{1}},\underbrace{0,\dots,0}_{m_{0}}),

It will also be convenient to write λ\lambda in frequency notation as λ=0m0,1m1,,sms\lambda=\langle 0^{m_{0}},1^{m_{1}},\dots,s^{m_{s}}\rangle. Unless otherwise stated, we will fix throughout some partition λ\lambda giving the content of the system, with ss species of particles and length λ\lambda.

A configuration is then a permutation of λ\lambda, and may be thought of as a composition (i.e. a tuple of non-negative integers). We write Ωλ\Omega_{\lambda} for the set of all configurations, which is the state-space of the Markov chain. For example,

Ω(2,1,0)={210,201,120,102,021,012}.\Omega_{(2,1,0)}=\{210,201,120,102,021,012\}.

The dynamics of the multispecies chain are as follows; the idea is that higher-numbered species are “stronger” than lower-numbered species, and can displace them. As above, a bell rings at each site jj at rate 1/xj1/x_{j}. When such a bell rings, if ηj=0\eta_{j}=0, i.e. the site jj is vacant, nothing changes. Otherwise, suppose jj contains a particle of species i1i_{1}. Then this particle moves to the first location j2j_{2} clockwise from jj with i2:=ηj2<i1i_{2}:=\eta_{j_{2}}<i_{1}. If this site j2j_{2} was previously vacant (i.e. i2=0i_{2}=0), the jump is complete; otherwise the particle of type i2i_{2} itself moves clockwise until it finds a site j3j_{3} with η(j3)<i2\eta(j_{3})<i_{2}. This game of ‘musical chairs’ continues, with stronger particles displacing weaker ones in turn, until a vacancy is found. All the particles involved move instantaneously to their chosen positions, leaving a vacancy at site jj.

An important observation is that the multispecies dynamics with ss species of particle can be seen as a coupling (the so-called “basic coupling”) of ss single-type PushTASEP processes. These can be obtained by regarding all species of type rr or higher as “particles” and all species of type r1r-1 or lower as “vacancies”, for any 1rs1\leq r\leq s. See 7 at the end of Section 2 for more details.

To illustrate the dynamics, consider the configuration η=(2,0,1,4,2,0,3,1)\eta=(2,0,1,4,\allowbreak 2,0,3,1) on n=8n=8 sites with s=4s=4 species. Then for example

(1.1) η{(2,0,1,0,4,2,3,1)with rate 1/x4,(2,1,1,4,2,0,0,3)with rate 1/x7.\eta\to\begin{cases}(2,0,1,0,4,2,3,1)&\text{with rate $1/x_{4}$},\\ (2,1,1,4,2,0,0,3)&\text{with rate $1/x_{7}$}.\end{cases}

If a bell rings either at site 22 or at site 66 rings, nothing changes.

The transition graph of the multispecies PushTASEP on Ω(2,1,0)\Omega_{(2,1,0)} is given in Figure 1.

Refer to caption
Figure 1. The transition graph of the multispecies PushTASEP with λ=(2,1,0)\lambda=(2,1,0).

Note that when a bell rings at a given site in a given configuration, the transition it triggers is deterministic. (This will no longer be true in the case t>0t>0.)

We start with an explicit formula for the stationary distribution. To state it, we first recall that the elementary symmetric polynomial eme_{m} for mnm\leq n is given by

(1.2) em(x1,,xn)=1i1<<imnxi1xim.e_{m}(x_{1},\dots,x_{n})=\sum_{1\leq i_{1}<\cdots<i_{m}\leq n}x_{i_{1}}\dots x_{i_{m}}.

For a partition μ\mu, we define eμ=ieμie_{\mu}=\prod_{i}e_{\mu_{i}}. We also need the notion of the ASEP polynomials, first defined in Cantini–de Gier–Wheeler [cantini-degier-wheeler-2015] and later named as such by Chen–de Gier–Wheeler [chen-degier-wheeler-2020], denoted fη(x1,,xn;q,t)\operatorname{f}_{\eta}(x_{1},\allowbreak\dots,x_{n};q,t). These are important nonsymmetric polynomials related to the well-known symmetric Macdonald polynomials Pλ(x1,,xn;q,t)P_{\lambda}(x_{1},\dots,x_{n};q,t). The ASEP polynomials, indexed by compositions η\eta, are polynomials in the variables x1,,xnx_{1},\dots,x_{n}, whose coefficients are rational functions in q,tq,t. We express the stationary distribution for a system with content λ\lambda using the family of ASEP polynomials fη\operatorname{f}_{\eta} where η\eta is a permutation of λ\lambda.

Theorem 1.

Let λ=0m0,1m1,,sms\lambda=\langle 0^{m_{0}},1^{m_{1}},\dots,s^{m_{s}}\rangle be a partition, and set Mi=mi++msM_{i}=m_{i}+\cdots+m_{s} for 1is1\leq i\leq s. The stationary distribution π\pi of the multispecies PushTASEP with content λ\lambda is given by

π(η)=fη(x1,,xn;q=1,t=0)Zλ,\pi(\eta)=\frac{\operatorname{f}_{\eta}(x_{1},\dots,x_{n};q=1,t=0)}{Z_{\lambda}},

for ηΩλ\eta\in\Omega_{\lambda}, where fη\operatorname{f}_{\eta} is the ASEP polynomial and

Zλ(x1,,xn)=Pλ(x1,,xn;1,0)=i=1s1eMi(x1,,xn)Z_{\lambda}(x_{1},\dots,x_{n})=P_{\lambda}(x_{1},\dots,x_{n};1,0)=\prod_{i=1}^{s-1}e_{M_{i}}(x_{1},\dots,x_{n})

is the partition function.

We discuss the ASEP polynomials further in Section 4, although we don’t give a full definition. For a definition in full generality, see for example [chen-degier-wheeler-2020, corteel-mandelshtam-williams-2022, ayyer-martin-williams-2024] for various approaches. If the reader prefers, 1 can instead be understood without any reference to ASEP polynomials, as a statement that the stationary probabilities are proportional to sums of weights of multiline diagrams, as defined in Section 4. See LABEL:thm:stat_prob_sum for a precise statement of the result in this form.

Note that in the homogenous case x1==xnx_{1}=\dots=x_{n}, the stationary distribution of the system is the same as for the multispecies TASEP, (as was already observed, more specifically for the system on the whole line, in [ferrari-martin-2006]).

LABEL:thm:stat_dist_multiline is a special case of the result proved in the more general case of the tt-PushTASEP for t0t\geq 0 in [ayyer-martin-williams-2024], via relationships between ASEP polynomials and non-symmetric Macdonald polynomials; however the more probabilistic approach explained here via the multiline process and time-reversal also seems interesting in its own right.

Our second main result is about the invariance of the process under permutations of the parameters (x1,,xn)(x_{1},\dots,x_{n}).

Theorem 2.

Consider the multispecies PushTASEP on the ring with content λ\lambda, started either in the stationary distribution, or in any starting configuration with ηΩλ\eta\in\Omega_{\lambda} in which ηk+1ηk+2ηn\eta_{k+1}\geq\eta_{k+2}\geq\dots\eta_{n}.

The distribution of the path of the process observed on sites 1,2,,k1,2,\dots,k is invariant under permutations of the parameters xk+1,,xnx_{k+1},\dots,x_{n}.

An analogous property was recently proved for the multispecies TAZRP [ayyer-mandelshtam-martin-2022] using results about interchangeability of exponential-server queues in series. To prove 2, we need to develop similar interchangeability results in a new context where the exponential-server queues are replaced by PushTASEP stations.

A related symmetry property for events depending just on the configuration at a single time in stationarity is obtained in the general case t0t\geq 0 in [ayyer-martin-williams-2024]. However the result of 2 is much stronger, both since it applies to systems out of stationarity, and since it applies to events which depend on the path of the process evolving over time. The question of whether this stronger symmetry property can also be extended to t>0t>0 seems very interesting.

Finally, we look at various important observables for the PushTASEP stationary distribution. We will give formulas for the density and current of particles in LABEL:sec:obs, which can be derived from the corresponding results for a single species system. Unlike in the homogeneous case, even the density of a given species at a given site is not obvious. A more intricate result is a formula for the nearest-neighbour two-point correlation, which is our third main result. This generalizes results of Ayyer–Linusson for the multispecies TASEP [ayyer-linusson-2016] and Amir–Angel–Valko for the TASEP speed process [amir-angel-valko-2011].

For the purposes of this discussion, we will restrict ourselves to λ=(n1,,1,0)\lambda=(n-1,\dots,1,0) with n1n-1 species of particles (but all other cases can be derived from this case by projection).

To state the result, we recall that the Schur polynomial sλ(x1,,xn)s_{\lambda}(x_{1},\dots,x_{n}) are an important family of symmetric polynomials playing a significant role in representation theory and algebraic geometry [stanley-ec2]. The Schur polynomial sλs_{\lambda} can be defined as a ratio of determinants,

(1.3) sλ(x1,,xn)=det(xiλj+nj)det(xinj).s_{\lambda}(x_{1},\dots,x_{n})=\frac{\det(x_{i}^{\lambda_{j}+n-j})}{\det(x_{i}^{n-j})}.

which is symmetric in x1,,xnx_{1},\dots,x_{n}. For 1i<jn1\leq i<j\leq n, define the polynomials

fj,i(x1,,xn)=det(1s2nj2(x3,,xn)s2ni2(x3,,xn)x1x2s11,2nj2(x3,,xn)s11,2ni2(x3,,xn)x1x2s2nj1(x3,,xn)s2ni1(x3,,xn)),f_{j,i}(x_{1},\dots,x_{n})=\\ \det\begin{pmatrix}1&s_{\langle 2^{n-j-2}\rangle}(x_{3},\dots,x_{n})&s_{\langle 2^{n-i-2}\rangle}(x_{3},\dots,x_{n})\\ -x_{1}-x_{2}&s_{\langle 1^{1},2^{n-j-2}\rangle}(x_{3},\dots,x_{n})&s_{\langle 1^{1},2^{n-i-2}\rangle}(x_{3},\dots,x_{n})\\ x_{1}x_{2}&s_{\langle 2^{n-j-1}\rangle}(x_{3},\dots,x_{n})&s_{\langle 2^{n-i-1}\rangle}(x_{3},\dots,x_{n})\end{pmatrix},

and

gj,i(x1,,xn)=a,b=02x13ax23bs(2ni2,a)(x3,,xn)×s(2nj2,b)(x3,,xn),g_{j,i}(x_{1},\dots,x_{n})=\sum_{a,b=0}^{2}x_{1}^{3-a}x_{2}^{3-b}s_{(2^{n-i-2},a)}(x_{3},\dots,x_{n})\\ \times s_{(2^{n-j-2},b)}(x_{3},\dots,x_{n}),

where s1m1,2m2=0s_{\langle 1^{m_{1}},2^{m_{2}}\rangle}=0 if m2m_{2} is negative.

Let η(i)k\eta^{(i)}_{k} denote the occupation variable for the particle of species ii at site kk, i.e., η(i)k=1\eta^{(i)}_{k}=1 (resp. η(i)k=0\eta^{(i)}_{k}=0) when the kkth site is occupied (resp. not occupied) by a particle of species ii (where “particle of species 0” means a vacancy).

Theorem 3.

Let 0i,jn10\leq i,j\leq n-1. Then the joint probability of seeing the particle of species jj at site 11 and that of species ii at site 22 is given by

η(j)1η(i)2={x1x22fj,i(x1,,xn)e(nj,nj1,ni,ni1)(x1,,xn)j<i,0j=i,gi+1,i(x1,,xn)e(ni,ni1,ni1,ni2)(x1,,xn)+x1x2s2nj1(x3,,xn)e(nj,nj)(x1,,xn)j=i+1,gi,j(x1,,xn)e(ni,ni1,nj,nj1)(x1,,xn)j>i+1.\langle\eta^{(j)}_{1}\eta^{(i)}_{2}\rangle=\begin{cases}\displaystyle x_{1}x_{2}^{2}\frac{f_{j,i}(x_{1},\dots,x_{n})}{e_{(n-j,n-j-1,n-i,n-i-1)}(x_{1},\dots,x_{n})}&j<i,\\ \vskip 9.0pt\cr 0&j=i,\\ \vskip 9.0pt\cr\displaystyle\frac{g_{i+1,i}(x_{1},\dots,x_{n})}{e_{(n-i,n-i-1,n-i-1,n-i-2)}(x_{1},\dots,x_{n})}&\\ \vskip 9.0pt\cr\hskip 28.45274pt\displaystyle+x_{1}x_{2}\frac{s_{\langle 2^{n-j-1}\rangle}(x_{3},\dots,x_{n})}{e_{(n-j,n-j)}(x_{1},\dots,x_{n})}&j=i+1,\\ \vskip 9.0pt\cr\displaystyle\frac{g_{i,j}(x_{1},\dots,x_{n})}{e_{(n-i,n-i-1,n-j,n-j-1)}(x_{1},\dots,x_{n})}&j>i+1.\end{cases}

The proof of 3 involves projecting from the multispecies system to a suitable 33-species system, for which the probabilities of relevant events can be analysed using 22-line diagrams.

Note that in all cases the two-point correlation function obtained in 3 is symmetric in x3,,xnx_{3},\dots,x_{n}, as must be the case in the light of 2. It is interesting to observe the appearance of the Schur polynomials in these expressions. In the homogeneous case, under suitable rescaling in the limit nn\to\infty, one obtains interesting asymptotics for the joint distribution of the species observed at the two sites as shown in [amir-angel-valko-2011]; setting (x,y)=(j/n,i/n)(x,y)=(j/n,i/n), one obtains a limit with constant density in the region x>yx>y, a singular term involving non-vanishing probability on the boundary x=yx=y, and repulsion from the boundary in the region x<yx<y. It would be interesting to explore asymptotics in regimes involving inhomogeneous parameters x1,,xnx_{1},\dots,x_{n}.

Note that the result of [ayyer-linusson-2016] has recently been extended in a different direction by Pahuja [pahuja-2023], who obtains nearest-neighbour two-point correlations for the multispecies ASEP (i.e. in our notation the case t>0t>0 with all xjx_{j} equal), based on the multiline diagram construction for the ASEP in [martin-2020].

The plan of the rest of the paper is as follows. Throughout, we consider the case of a multispecies PushTASEP whose contents are fixed and given by some partition λ\lambda. In Section 2, we will derive the stationary distribution for the single species inhomogeneous PushTASEP as well as formulas for the density and current; we also explain the interpretation of the multispecies system as a basic coupling of single species systems. In Section 3, we give a proof of the interchangeability of rates for the single species PushTASEP and use that to prove 2. In Section 4, we define multiline diagrams and construct a multiline process which will lump to the multispecies PushTASEP, in order to obtain the stationary distribution in 1. Finally, in LABEL:sec:obs, we will prove formulas for the current and the density as well as the formula for the two-point correlations in 3.

2. Single species PushTASEP

In this section, we focus on the PushTASEP with a single species of particle, i.e. s=1s=1. As before, we take nn sites. Therefore, λ=0m0,1m1\lambda=\langle 0^{m_{0}},1^{m_{1}}\rangle with m1<nm_{1}<n particles (and so m0=nm1m_{0}=n-m_{1} vacancies) and periodic boundary conditions.

Recall that Ωλ\Omega_{\lambda} is the configuration space. For example, consider the case m0=m1=2m_{0}=m_{1}=2. With the lexicographic ordering of the configurations, i.e.,

Ω(1,1,0,0)={0011,0101,0110,1001,1010,1100},\Omega_{(1,1,0,0)}=\{0011,0101,0110,1001,1010,1100\},

the transition graph of the chain is given in Figure 2.

Refer to caption
Figure 2. The transition graph of the single species PushTASEP with m0=m1=2m_{0}=m_{1}=2.

We are interested in the stationary distribution of this process. It is easy to see that the single species PushTASEP is irreducible. Therefore, the stationary distribution is unique. The the following proposition is straightforward to prove using the master equation.

Proposition 4.

The stationary probability π\pi of ηΩ0m0,1m1\eta\in\Omega_{\langle 0^{m_{0}},1^{m_{1}}\rangle} for the PushTASEP is

π(η)=1em1(x1,,xn)i=1ηi=1nxi.\pi(\eta)=\frac{1}{e_{m_{1}}(x_{1},\dots,x_{n})}\prod_{\begin{subarray}{c}i=1\\ \eta_{i}=1\end{subarray}}^{n}x_{i}.

Recall that the density at site ii is the probability of finding a particle at site ii in the stationary distribution. We will use angular brackets \langle\cdot\rangle to denote expectations in the stationary distribution. As is usual, we let ηj\eta_{j} be the indicator variable for a particle at site jj, so that ηj\langle\eta_{j}\rangle is the density at site jj. Because of the factorized nature of the stationary distribution in 4, we immediately obtain the following.

Corollary 5.

The density at site jj in the stationary distribution is given by

ηj=xjem11(x1,,xj^,,xn)em1(x1,,xn),\langle\eta_{j}\rangle=\frac{x_{j}e_{m_{1}-1}(x_{1},\dots,\widehat{x_{j}},\dots,x_{n})}{e_{m_{1}}(x_{1},\dots,x_{n})},

where the hat on an argument denotes its absence.

The current of a particle across a given edge (say (n,1)(n,1)) is the number of particles per unit time that cross that edge in stationarity. Because of particle conservation, the current is the same for all edges. We will denote the current by JJ. In terms of the stationary distribution for the PushTASEP, this is given by

(2.1) J=j=m0+1n1xjηjηn.J=\sum_{j=m_{0}+1}^{n}\frac{1}{x_{j}}\langle\eta_{j}\cdots\eta_{n}\rangle.
Proposition 6.

The current in the stationary distribution is given by

J=em11(x1,,xn)em1(x1,,xn).J=\frac{e_{m_{1}-1}(x_{1},\dots,x_{n})}{e_{m_{1}}(x_{1},\dots,x_{n})}.
Proof.

Using arguments similar to the proof of 5, it is easy to see that

ηjηn=xjxnejm01(x1,,xj1)em1(x1,,xn).\langle\eta_{j}\dots\eta_{n}\rangle=x_{j}\cdots x_{n}\frac{e_{j-m_{0}-1}(x_{1},\dots,x_{j-1})}{e_{m_{1}}(x_{1},\dots,x_{n})}.

Plugging this into (2.1), we obtain, after setting k=jm01k=j-m_{0}-1,

(2.2) J=k=0m11xm0+2+kxnek(x1,,xm0+k)em1(x1,,xn).J=\sum_{k=0}^{m_{1}-1}x_{m_{0}+2+k}\cdots x_{n}\frac{e_{k}(x_{1},\dots,x_{m_{0}+k})}{e_{m_{1}}(x_{1},\dots,x_{n})}.

We now note an elementary recursive formula for the elementary symmetric function em(x1,,xk)e_{m}(x_{1},\dots,x_{k}) in (1.2). First, split this into terms according to whether xkx_{k} appears or not to obtain

em(x1,,xk)=em(x1,,xk1)+xkem1(x1,,xk1).e_{m}(x_{1},\dots,x_{k})=e_{m}(x_{1},\dots,x_{k-1})+x_{k}e_{m-1}(x_{1},\dots,x_{k-1}).

Now, successively apply this recurrence to each variable starting from xk1x_{k-1} and progressing up to x1x_{1}, to get

em(x1,,xk)=i=k+1mk+1xixkemk1+i(x1,,xi2).e_{m}(x_{1},\dots,x_{k})=\sum_{i=k+1-m}^{k+1}x_{i}\cdots x_{k}\,e_{m-k-1+i}(x_{1},\dots,x_{i-2}).

One can check that the right hand side of this equation, after appropriate change of variables can be applied to (2.2). This gives the desired result. ∎

We have the following projection property for our multispecies dynamics. If we view all particles of species r,,sr,\dots,s as “particles”, and all particles of lower species 1,,r11,\dots,r-1 as vacancies, then we obtain a single species process with Mi=mi++msM_{i}=m_{i}+\dots+m_{s} particles and nMin-M_{i} vacancies.

Considering such projects for all r=1,2,,sr=1,2,\dots,s, we can see the multispecies process as a coupling of ss single species processes. This is the basic coupling [liggett-1985, Chapter VIII, Section 2] (under which the bells ring at the same sites at the same types in all the coupled single species systems).

More generally, we can project from a “finer” multispecies system to another “coarser” one, allowing the merging of two or more adjacent classes into one:

Proposition 7.

Let ϕ:\phi:\mathbb{N}\mapsto\mathbb{N} be any function with ϕ(0)=0\phi(0)=0 which is weakly order-preserving (i.e. for all i<ji<j, ϕ(i)ϕ(j)\phi(i)\leq\phi(j)). Then the multispecies PushTASEP with particle content λ=(λ1,,λn))\lambda=(\lambda_{1},\dots,\lambda_{n})). lumps to the multispecies PushTASEP with particle content given by ϕ(λ)\phi(\lambda), where ϕ(λ)\phi(\lambda) is the partition (ϕ(λ1),,ϕ(λn))(\phi(\lambda_{1}),\dots,\phi(\lambda_{n})).

Proof.

This is an elementary consequence of the dynamics. We “recolour” the particles of the system, giving any particle previously of species rr the new label ϕ(r)\phi(r). It is an easy case-analysis to check that for any transition (caused by a bell at some site jj), the result is independent of whether the recolouring is performed before or after the transition. For example, consider the system with content 02,12,22,31,41\langle 0^{2},1^{2},2^{2},3^{1},4^{1}\rangle and the second transition in (1.1). Applying the map ϕ\phi given by ϕ(0)=0\phi(0)=0, ϕ(1)=ϕ(2)=ϕ(3)=1\phi(1)=\phi(2)=\phi(3)=1, ϕ(4)=2\phi(4)=2, we recolour to the system with content 02,15,21)\langle 0^{2},1^{5},2^{1}),and the transition becomes (1,0,1,2,1,0,1,1)(1,1,1,2,1,0,0,1)(1,0,1,2,1,0,1,1)\to(1,1,1,2,1,0,0,1) in either case. ∎

To map to a single species system as described just above, we would apply the map ϕr\phi^{r} with ϕr(i)=0\phi^{r}(i)=0 for i<ri<r, and ϕr(i)=1\phi^{r}(i)=1 for iri\geq r.

3. Interchangeability of rates

Weber [Weber1979] proved an interchangeability result for exponential queueing servers in tandem. Consider two independent ./M/1./M/1 queueing servers (i.e. servers who offer service at the times of a Poisson process) in tandem, with service rates μ1\mu_{1} and μ2\mu_{2}. The first queue has some arrival process AA, with an arbitrary distribution (for example, it could be deterministic), which is independent of the service processes. By “tandem” we mean that a customer leaving the first queue immediately joins the second queue; the departure process from the first server is the arrival process of the second.

Then Weber’s result is that the law of the departure process from the system (i.e. of the departure process from the second queue) is the same if the rates μ1\mu_{1} and μ2\mu_{2} are interchanged.

Various different proofs of this result were subsequently given; a significant one from our point of view was a coupling proof by Tsoucas and Walrand [TsoucasWalrand1987]. They constructed a coupling of two pairs of independent Poisson processes, (S1,S2)(S_{1},S_{2}) with rates μ1,μ2\mu_{1},\mu_{2} and (S~1,S~2)({\widetilde{S}}_{1},{\widetilde{S}}_{2}) with rates μ2,μ1\mu_{2},\mu_{1}, such that for any arrival process AA, the output of the system with arrival process AA and service processes (S1,S2)(S_{1},S_{2}) is the same as that of the system with arrival process AA and serice processes (S~1,S~2)({\widetilde{S}}_{1},{\widetilde{S}}_{2}).

This stronger result, holding simultaneously for all arrival processes, makes it possible to extend to a multispecies framework (since, along the lines we have already seen above, a multispecies configuration can be seen as a coupling of several single species configurations). See for example [MartinPrabhakar2010] for extensive discussion and applications.

In this section we develop similar ideas in a new context, to obtain interchangeability of rates of PushTASEP stations. We will ultimately be able to apply them to get the result of 2.

We consider the PushTASEP on the ring for this work, but the result below applies equally to any one-dimensional lattice (such as a closed or open interval or all of \mathbb{Z}). Each site jj has an associated parameter xjx_{j}. Bells ring independently as Poisson processes at each site, with rate 1/xj1/x_{j} at site jj. Recall that when a bell rings at site jj in the single species PushTASEP:

  • if jj is empty, nothing happens.

  • if jj is occupied, then:

    • jj becomes empty;

    • the first empty site kk to the right of jj becomes occupied;

    which we call a transfer of a particle from jj to kk.

For each lattice bond (j,j+1)(j,j+1), we have a “flux process” across the bond; a point process Fj,j+1F_{j,j+1} which records the times when there is a transfer of a particle from jj or a site to its left to j+1j+1 or a site to its right.

Fix a site jj. Consider the system started from, say, time 0. If we know the flux process Fj1,jF_{j-1,j} for the bond on the left of jj, the initial occupancy of the site jj, and the Poisson process of bells at site jj, then we can obtain the flux process Fj,j+1F_{j,j+1} for the bond on the right of jj.

Iterating, this now works for any finite interval j,j+1,,j+kj,j+1,\dots,j+k, where k0k\geq 0. Given the flux process Fj1,jF_{j-1,j} at the left end of the interval, the initial configuration inside the interval, and the bell processes inside the interval, one can obtain the flux process Fj+k,j+k+1F_{j+k,j+k+1} at the right end. For the moment we only need the case k=1k=1.

We write PP(ρ)\mathrm{PP}(\rho) to denote a Poisson process with rate ρ\rho. This is our interchangeability result.

Theorem 8.

Consider two neighbouring sites jj, j+1j+1 with parameters xj,xj+1x_{j},x_{j+1}. Regard the output flux process R=Fj+1,j+2R=F_{j+1,j+2} on the time-interval [0,)[0,\infty) as a function R(L,A,B,η01)R(L,A,B,\eta_{01}) of:

  • the input flux process L=Fj1,jL=F_{j-1,j} on [0,)[0,\infty);

  • the Poisson processes AA and BB of bells at sites jj and j+1j+1 respectively;

  • the time-0 occupancies of sites jj and j+1j+1, denoted by η01=(ηj,ηj+1){0,1}2\eta_{01}=(\eta_{j},\eta_{j+1})\in\{0,1\}^{2}.

Then there exists a coupling of

(A,B)\displaystyle(A,B) PP(1xj)PP(1xj+1)\displaystyle\sim\mathrm{PP}\left(\frac{1}{x_{j}}\right)\otimes\mathrm{PP}\left(\frac{1}{x_{j+1}}\right)
and
(A~,B~)\displaystyle({\widetilde{A}},{\widetilde{B}}) PP(1xj+1)PP(1xj)\displaystyle\sim\mathrm{PP}\left(\frac{1}{x_{j+1}}\right)\otimes\mathrm{PP}\left(\frac{1}{x_{j}}\right)

with the property that for every locally finite LL, and for every η01{(0,0),(1,1),(1,0)}\eta_{01}\in\{(0,0),\allowbreak(1,1),(1,0)\},

R(L,A,B,η01)=R(L,A~,B~,η01)R(L,A,B,\eta_{01})=R(L,{\widetilde{A}},{\widetilde{B}},\eta_{01})

with probability 11.

See Figure 3 for an illustration. This theorem says that the bell rates 1/xj1/x_{j} and 1/xj+11/x_{j+1} at the neighbouring sites jj and j+1j+1 are interchangeable.

Refer to caption
Figure 3. Illustration of the set-up of 8.

Before we begin the proof, we describe the coupling. First, we will use ρ=1/xj\rho=1/x_{j} and ρ=1/xj+1\rho^{\prime}=1/x_{j+1} in the rest of this section to keep the notation simple. Recall that a basic fact about Poisson process is the thinning theorem [durrett-2016], which in our context reads as follows. We can describe (A,B)PP(ρ)PP(ρ)(A,B)\sim\mathrm{PP}(\rho)\otimes\mathrm{PP}(\rho^{\prime}) via a single Poisson process of rate ρ+ρ\rho+\rho^{\prime} which is the superposition of AA and BB, with a mark aa or bb attached to each point, according to whether it comes from the process AA or BB respectively. Given the points of A+BA+B, the marks are i.i.d. and each is aa with probability ρ/(ρ+ρ)\rho/(\rho+\rho^{\prime}) and bb with probability ρ/(ρ+ρ)\rho^{\prime}/(\rho+\rho^{\prime}). If we index the points of A+BA+B with \mathbb{Z} in increasing order, say with point 0 the last to occur before time 0 and point 11 the first to occur after time 0, then we can identify the sequence of marks with an element (wi,i){a,b}(w_{i},i\in\mathbb{Z})\in\{a,b\}^{\mathbb{Z}}.

Under our coupling, the superposition A~+B~{\widetilde{A}}+{\widetilde{B}} will be the same as A+BA+B; we will just change (some of) the marks. Consider occurrences of the motif abab, that is, look for ii such that wi=aw_{i}=a, wi+1=bw_{i+1}=b. The set 𝒞\mathcal{C} of such ii has a distribution which is invariant under interchanging ρ\rho and ρ\rho^{\prime}. This is because if i1<i2<<ini_{1}<i_{2}<\dots<i_{n}, then P(i1,,in𝒞)P(i_{1},\dots,i_{n}\in\mathcal{C}) is equal to 0 if ikik1=1i_{k}-i_{k-1}=1 for some kk, and otherwise is equal to ρn(ρ)n/(ρ+ρ)2n\rho^{n}(\rho^{\prime})^{n}/(\rho+\rho^{\prime})^{2n}. This means there exists a coupling of (A,B)(A,B) and (A~,B~)({\widetilde{A}},{\widetilde{B}}) with the required distributions such that:

  • the superpositions A+BA+B and A~+B~{\widetilde{A}}+{\widetilde{B}} are the same;

  • the occurrences of the motif abab are the same in both processes.

These are the only properties we will need, but we can make the coupling explicit as follows. The abab motifs are separated by words of the form bab^{*}a^{*}, consisting of some number (maybe 0) of bb’s followed by some number (maybe 0) of aa’s. Conditional on the length nn of the string, the probability that it consists of n1n_{1} bb’s followed by n2n_{2} aa’s (where 0n1,n20\leq n_{1},n_{2}, with n1+n2=nn_{1}+n_{2}=n) is proportional to

(3.1) (ρ)n1ρn2.(\rho^{\prime})^{n_{1}}\rho^{n_{2}}.

An explicit way to realise the coupling is to obtain the process (A~,B~)({\widetilde{A}},{\widetilde{B}}) from (A,B)(A,B) as follows. Leave the abab motifs unchanged. As for the bnbanab^{n_{b}}a^{n_{a}} separating them, replace it instead by bnaanbb^{n_{a}}a^{n_{b}}. This is illustrated in Figure 4. Because of (3.1), this has the effect of interchanging the probability of aa and bb as desired.

Remark 9.

Equivalently, rather than using this deterministic scheme, one could just resample each of the strings independently according to the new desired measure. One can also think about all of this in terms of run lengths of consecutive aa’s and bb’s (which are independent, geometric (ρ/(ρ+ρ)\rho^{\prime}/(\rho+\rho^{\prime})) for the aa’s and geometric(ρ/(ρ+ρ)\rho/(\rho+\rho^{\prime})) for the bb’s).

Refer to caption
Figure 4. Illustration of the coupling scheme. This version shows the deterministic scheme explained above. The point marked with a question mark symbol will either belong to A~{\widetilde{A}} or B~{\widetilde{B}} depending on the points before it.
Proof of 8.

We will consider two systems – call them SS and S~{\widetilde{S}}. In each one we have two sites jj and j+1j+1. We have the same input flux process L=Fj1,jL=F_{j-1,j}. We have bell processes at jj and j+1j+1 respectively given by AA and BB in system SS, and A~{\widetilde{A}} and B~{\widetilde{B}} in system S~{\widetilde{S}}. The claim is that the output flux processes Fj+1,j+2F_{j+1,j+2} are exactly the same (not just the same in distribution) in both systems.

The initial configuration η\eta is the same in both systems, with η01=(ηj,ηj+1)\eta_{01}=(\eta_{j},\eta_{j+1}) being one of (0,0)(0,0), (1,0)(1,0), or (1,1)(1,1). See 10 after this proof for discussion of why (ηj,ηj+1)(\eta_{j},\eta_{j+1}) cannot be (0,1)(0,1). Since the flux into {j,j+1}\{j,j+1\} on the left is the same in the two systems, and they start with the same number of particles, in order to conclude that the flux out of {j,j+1}\{j,j+1\} on the right is the same in the two systems it will be enough to observe that the number of particles in these two sites remains the same across both systems for all times.

We work by induction to determine whether there could be a first moment when the number of particles in SS and S~{\widetilde{S}} do not agree. Let us first check whether an extra particle could be added in one system and not in the other. This could happen only when a point of LL occurs. But a point of LL always adds a particle unless the system is occupied in both jj and j+1j+1. So if a point of LL adds a particle in one system but not the other, it can only be because the numbers already didn’t agree.

Hence it would have to be that one system loses a particle, while the other does not. This would have to happen due to a bell ringing at either jj or j+1j+1. Recall that such bells happen simultaneously in SS and S~{\widetilde{S}}, though not necessarily in the same place (that is, the superpositions A+BA+B and A~+B~{\widetilde{A}}+{\widetilde{B}} are the same). First suppose both systems were previously full. Then any such bell loses a particle from both systems. So, the only way for the numbers to become unbalanced would be for both systems to contain one particle, and then for one of them (but not the other) to become empty. We will now show that both systems necessarily become empty at the same time.

This boils down to a case analysis. First, take the case where at time 0 these two sites are full (i.e. (ηj,ηj+1)=(1,1)(\eta_{j},\eta_{j+1})=(1,1)), or in the state (1,0)(1,0). In this case, for the system to be empty at a given time, it is necessary and sufficient that since the last point of LL (or since time 0 if there has been no point of LL), there has been a bell at jj followed by a bell at j+1j+1. That is, we need to have observed the motif abab in the marks of the Poisson process. But our coupling ensures that this motif occurs at identical times in the systems SS and S~{\widetilde{S}}. The case where the system starts empty (i.e. η=(0,0)\eta=(0,0)) is similar. In this case, if there has been no point of LL, then the system remains empty. If there has been a point of LL, then as above, for the system to be empty we need to have seen the motif abab since the last such point.

Hence the number of particles in the two systems SS and S~{\widetilde{S}} must remain the same at all times. It follows that the output flux processes RR and R~{\tilde{R}} are the same, as desired. ∎

Remark 10.

The proof above fails, as it must, if instead we start from the configuration (0,1)(0,1). Then if we observe a bell at j+1j+1 in one system, but at jj in the other, then the former may have a point of the output flux process, while the latter does not.

Remark 11.

In the setting above we can also take the “input process” to be defined on all times in \mathbb{R}, and similarly obtain an output process for all times in \mathbb{R}. (This works straightforwardly since there are arbitrarily early times when we know the occupancy state of jj; whenever the bell at jj rings, it becomes empty.) Then we may regard a single PushTASEP site as an operator which maps distributions of input processes to distributions of output processes. Recalling Burke’s theorem for exponential-server queues, we can ask whether all the ergodic fixed points of this map to be Poisson processes.

The fact that our coupling of (A,B)(A,B) and (A~,B~)({\widetilde{A}},{\widetilde{B}}) works simultaneously over all input processes LL means that we can pass from a single species result to a multispecies result.

Proof of 2.

First consider a single species PushTASEP on a ring of nn sites, with kk particles for some 1kn11\leq k\leq n-1.

Imagine two versions SS and S~{\widetilde{S}} with the same initial configuration of this system, with the rates 1/xj1/x_{j} and 1/xj+11/x_{j+1} at sites jj and j+1j+1 swapped between the two. We may couple SS and S~{\widetilde{S}} using identical bell processes between the two systems everywhere except jj and j+1j+1, and using the coupling provided by 8 for the bell processes at sites jj and j+1j+1.

Suppose we start the two systems in the same configuration at time 0, with the configuration at sites (j,j+1)(j,j+1) being one of (0,0)(0,0), (1,0)(1,0) or (1,1)(1,1). Imagining the two systems evolving one bell at a time, we can see there is never a first moment when the flux processes Fj1,jF_{j-1,j} and Fj+1,j+2F_{j+1,j+2} are different between the two systems. One minor subtlety can arise on the ring if there are n1n-1 particles. A bell at site j+1j+1 can “cause” a push which propagates almost all the way around the ring, to create a point in the flux process Fj1,jF_{j-1,j}. For this to happen, both systems must be in state (0,1)(0,1) on the sites (j,j+1)(j,j+1), and both must experience a bell at j+1j+1. Afterwards they are both in state (1,0)(1,0) on those two sites, and the coupling between the two systems proceeds without problem.

Now we proceed to the multispecies PushTASEP on the ring of size nn. We view the multispecies PushTASEP as a coupling of several single species PushTASEPs. We take some initial condition on the multispecies system in which the particle at site jj is at least as strong as the particle at site j+1j+1. This means that in all the single species projections, the configuration at (j,j+1)(j,j+1) is in {(0,0),(1,0),(1,1)}\{(0,0),(1,0),(1,1)\}. Again we consider a coupling between two systems with rates (1/xj,1/xj+1)(1/x_{j},1/x_{j+1}) or (1/xj+1,1/xj)(1/x_{j+1},1/x_{j}) at jj and j+1j+1 respectively, with all the other rates remaining the same. As before we use the coupling of the bell processes at sites jj and j+1j+1 given by 8, and at all other sites, we keep the bell processes identical between the two systems. Since all the single species projections look the same between the two systems outside {j,j+1}\{j,j+1\}, the same is true of the multispecies system which is the coupling of those single species systems.

Now as in the statement of 2, we may fix any kk, and consider an initial condition in which ηk+1ηn\eta_{k+1}\geq\dots\geq\eta_{n}. From the argument above, we may exchange the parameters of any two neighbouring sites in {k+1,,n}\{k+1,\dots,n\} while preserving the distribution of the process as observed on sites {1,2,,k}\{1,2,\dots,k\}. But then we can perform a sequence of such nearest-neighbour transpositions to realise any desired permutation of the parameters xk+1,,xnx_{k+1},\dots,x_{n}. So indeed the distribution is symmetric under permutation of these parameters, as desired.

Finally we wish to show the same property for events defined on the time interval [0,)[0,\infty) starting from the stationary distribution. Consider the system started from any initial configuration satisfying ηk+1ηn\eta_{k+1}\geq\dots\geq\eta_{n}. Since the system is an irreducible Markov chain on a finite state-space, it has a unique stationary distribution, to which it converges from this initial condition. In particular, we may arbitrarily closely approximate the probability of any event on [0,)[0,\infty) starting from stationarity by taking the probability of an appropriate event on [T,)[T,\infty) for large enough TT. Since the probabilities of all such approximating events are symmetric in xk+1,,xnx_{k+1},\dots,x_{n}, the same must also be true of the original event. ∎

4. Multiline PushTASEP

In this section we discuss how the strategy of Ferrari and Martin [ferrari-martin-2006] adapts to give the result of 1. Theorem 4 of [ferrari-martin-2006] refers to a multispecies version of the Hammersley-Aldous-Diaconis process – see the comment at the end of Section 2 of that paper for the relationship between the HAD and the PushTASEP (or “long-range exclusion process”) via reversing the order of the particles. The main novelty in our setting is the introduction of site-wise inhomogeneity via the parameters x1,,xnx_{1},\dots,x_{n}.

Here is the outline of the strategy for studying the stationary distribution of the multispecies process on Ωλ\Omega_{\lambda}, where the partition λ\lambda gives the contents on the system.

  • We consider a set Ω^λ{\widehat{\Omega}}_{\lambda} of multiline diagrams and a map Π\Pi from Ω^λ{\widehat{\Omega}}_{\lambda} to the set Ωλ\Omega_{\lambda} of PushTASEP configurations.

  • We construct a Markov chain on the set of multiline diagrams (the multiline process) and find its stationary distribution using a time-reversal argument (LABEL:thm:stat_dist_multiline). In the homogeneous case, this stationary distribution was simply the uniform distribution; now that we introduce site-wise inhomogeneity, we get a distribution with weights proportional to monomials in the parameters x1,,xnx_{1},\dots,x_{n}.

  • We show that the projection of the multiline process under the map Π\Pi is the multispecies PushTASEP (LABEL:lem:projection). From this we deduce the stationary distribution π\pi of the multispecies PushTASEP, with weights proportional to sums of monomials in the parameters x1,,xnx_{1},\dots,x_{n} (LABEL:thm:stat_prob_sum).

To obtain the form of the stationary distribution given in 1, we finally apply the correspondence between ASEP polynomials and weights of multiline diagrams given by [corteel-mandelshtam-williams-2022].

We concentrate particularly on the argument for LABEL:thm:stat_dist_multiline, where the inhomgoneity plays a significant role. In contrast, in the argument for LABEL:lem:projection, the rates are irrelevant, and we outline the idea briefly.

Before we move on to the proof, we state important properties of the multispecies PushTASEP. First, one can see that it is irreducible if all xix_{i}’s are positive and finite by the following argument. Suppose η,ηΩλ\eta,\eta^{\prime}\in\Omega_{\lambda}. Starting from η\eta, initiate transitions starting at the locations of species ss’s until they are in their correct positions in η\eta^{\prime}. Now, initiate transitions starting at the (s1)(s-1)’s. These will clearly not affect the ss’s. Continue this way until all particles are in their correct location in η\eta^{\prime}.

4.1. Multiline diagrams

Multiline diagrams were introduced to construct the stationary distribution of the multispecies TASEP [ferrari-martin-2007]. The basic definition has since been extended in several ways. One rather general set-up is given by [corteel-mandelshtam-williams-2022], incorporating parameters t0t\geq 0, q0q\geq 0 and variables x1,,xnx_{1},\dots,x_{n} to give combinatorial constructions of the ASEP polynomials and non-symmetric Macdonald polynomials. Here we need only the basic case t=0t=0 and q=1q=1; the variables here denoted x1,,xnx_{1},\dots,x_{n} reflect the site-wise inhomogeneity.

A multiline diagram with contents given by λ=0m0,1m1,,sms\lambda=\langle 0^{m_{0}},1^{m_{1}},\dots,s^{m_{s}}\rangle, is a configuration on a discrete cylinder with ss rows and n=imin=\sum_{i}m_{i} columns as follows. Rows are indexed 11 to ss from bottom to top, and columns 11 to nn from left to right. Each site has either a particle (denoted \bullet) or a vacancy (denoted \circ). In row ii, there are Mi=mi++msM_{i}=m_{i}+\cdots+m_{s} particles, and so nMin-M_{i} vacancies. The set of such multiline diagrams is denoted Ω^λ\widehat{\Omega}_{\lambda}.

For example,

(4.1) Ω^(2,1,0)={,,,,,,,,}\widehat{\Omega}_{(2,1,0)}=\left\{\begin{array}[]{ccc}\bullet&\circ&\circ\\ \bullet&\bullet&\circ\end{array},\begin{array}[]{ccc}\bullet&\circ&\circ\\ \bullet&\circ&\bullet\end{array},\begin{array}[]{ccc}\bullet&\circ&\circ\\ \circ&\bullet&\bullet\end{array},\begin{array}[]{ccc}\circ&\bullet&\circ\\ \bullet&\bullet&\circ\end{array},\right.\\ \left.\begin{array}[]{ccc}\circ&\bullet&\circ\\ \bullet&\circ&\bullet\end{array},\begin{array}[]{ccc}\circ&\bullet&\circ\\ \circ&\bullet&\bullet\end{array},\begin{array}[]{ccc}\circ&\circ&\bullet\\ \bullet&\bullet&\circ\end{array},\begin{array}[]{ccc}\circ&\circ&\bullet\\ \bullet&\circ&\bullet\end{array},\begin{array}[]{ccc}\circ&\circ&\bullet\\ \circ&\bullet&\bullet\end{array}\right\}

We now describe a map Π:Ω^λΩλ\Pi:\widehat{\Omega}_{\lambda}\to\Omega_{\lambda} from the set of multiline diagrams to the set Ωλ\Omega_{\lambda} of multispecies PushTASEP configurations with contents given by the same partition λ\lambda.

\circ\circ4\bullet_{4}\circ\circ\circ4\bullet_{4}\circ\circ\circ\circ\circ\circ\circ4\bullet_{4}4\bullet_{4}3\bullet_{3}\circ3\bullet_{3}2\bullet_{2}\circ2\bullet_{2}\circ4\bullet_{4}\circ\circ4\bullet_{4}4\bullet_{4}3\bullet_{3}0\circ_{0}2\bullet_{2}2\bullet_{2}4\bullet_{4}1\bullet_{1}1\bullet_{1}0\circ_{0}
Figure 5. A multiline diagram η^Ω^λ\hat{\eta}\in\widehat{\Omega}_{\lambda} with λ=(4,4,3,2,2,1,1,0,0)\lambda=(4,4,3,2,2,1,1,0,0) so that n=9n=9, with the bully-path projection to a configuration of the multispecies TASEP. Here Π(η)\Pi(\eta) is the configuration (4,3,0,2,2,4,1,1,0)Ωλ(4,3,0,2,2,4,1,1,0)\in\Omega_{\lambda}, as given by the bottom row.

Suppose η^Ω^λ\hat{\eta}\in\widehat{\Omega}_{\lambda}. To obtain Π(η^)\Pi({\hat{\eta}}) from η^{\hat{\eta}} we will assign each of the particles in the multiline diagram η^{\hat{\eta}} a species label from 11 to ss. Any particle in row rr receives a label at least as large as rr. The assignment can be done recursively row by row starting at the top:

  1. (1)

    All the particles in row ss are labelled ss.

  2. (2)

    Suppose we have labelled all the particles in rows s,s1,,r+1s,s-1,\dots,r+1. To label the particles in row rr, we take in turn each of the particles in row r+1r+1, in decreasing order of labels. We break ties arbitrarily, for example from left to right. To each of those row-(r+1)(r+1) particles, we are going to match a row-rr particle.

  3. (3)

    To match a row-(r+1)(r+1) particle, say in column jj: we look in columns j,j+1,j,j+1,\dots in turn (wrapping cyclically around the ring from nn to 11 if needed), until we first find a particle in row rr which has not yet been matched. The first one we find is the match of the row-(r+1)(r+1) particle, and it receives the same species.

  4. (4)

    To all the row-rr particles which remain unmatched once all the row-(r+1)(r+1) particles have been considered, we assign species rr.

  5. (5)

    In this way we recursively label all the particles in the diagram. Finally we assign label 0 to all the vacancies in row 11. The bottom row can now be read as a configuration in Ωλ\Omega_{\lambda}, and this is Π(η^)\Pi({\hat{\eta}}).

An example of this procedure is given in Figure 5.

When Π(η^)=η\Pi({\hat{\eta}})=\eta, we may say that the multiline diagram η^{\hat{\eta}} has bottom row η\eta.

This is exactly the same procedure as was done for the TASEP on the ring in [ferrari-martin-2007] (with the notational difference that the numbering of the particles is reversed).

4.2. Multiline process

We now construct a process on multiline diagrams, i.e. a Markov chain whose state-space is Ω^λ{\widehat{\Omega}}_{\lambda}.

As in the PushTASEP we will associate a bell which rings at rate 1/xi1/x_{i} to each site ii. We think of such a bell ringing at the corresponding site in the bottom row, i.e. at (1,ii)(1,i_{i}) where i1=ii_{1}=i, and it will cause a PushTASEP jump in the (single-species) particle configuration on the bottom row. Then in turn it will trigger a chain reaction of bells at sites (2,i2),,(s,is)(2,i_{2}),\dots,(s,i_{s}) on each row of the diagram which cause PushTASEP jumps in the configuration of that row. This occurs in the following way. When the bell on row rr rings at (r,ir)(r,i_{r}) for some 1rs1\leq r\leq s, either

  • (a)

    the site (r,ir)(r,i_{r}) is empty, in which case the configuration on row rr remains unchanged, and we set ir+1=iri_{r+1}=i_{r}: the new bell rings immediately above;

  • (b)

    the site (r,ir)(r,i_{r}) contains a particle. This particle jumps to the first empty site on the same row to its right (wrapping cyclically). Let ir+1i_{r+1} be the column to which it jumps, so that the new bell rings above the destination site of the jumping particle.

These PushTASEP moves in all rows occur simultaneously. We say the transition starts in column i1i_{1} and ends in column is+1i_{s+1} (the destination site of the particle jumping in row ss).

We call this chain the multiline PushTASEP. See LABEL:fig:multiline_transition for an example of a transition.