SearcharxivSearch

arXiv · 2204.09206

Noncolliding Macdonald Walks with an Absorbing Wall

Abstract

The branching rule is one of the most fundamental properties of the Macdonald symmetric polynomials. It expresses a Macdonald polynomial as a nonnegative linear combination of Macdonald polynomials with smaller number of variables. Taking a limit of the branching rule under the principal specialization when the number of variables goes to infinity, we obtain a Markov chain of $m$ noncolliding particles with negative drift and an absorbing wall at zero. The chain depends on the Macdonald parameters $(q,t)$ and may be viewed as a discrete deformation of the Dyson Brownian motion. The trajectory of the Markov chain is equivalent to a certain Gibbs ensemble of plane partitions with an arbitrary cascade front wall. In the Jack limit $t=q^{\beta/2}\to 1$ the absorbing wall disappears, and the Macdonald noncolliding walks turn into the $\beta$-noncolliding random walks studied by Huang [Int. Math. Res. Not. 2021 (2021), 5898-5942, arXiv:1708.07115]. Taking $q=0$ (Hall-Littlewood degeneration) and further sending $t\to 1$, we obtain a continuous time particle system on $\mathbb{Z}_{\ge 0}$ with inhomogeneous jump rates and absorbing wall at zero.

Explore related subjects

Keep this discovery

BibTeXRIS

Leonid Petrov. 2022-04-20. Noncolliding Macdonald Walks with an Absorbing Wall. https://doi.org/10.3842/sigma.2022.079

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR