SearcharxivSearch

arXiv · 1802.08210

Half-space Macdonald processes

Abstract

Macdonald processes are measures on sequences of integer partitions built using the Cauchy summation identity for Macdonald symmetric functions. These measures are a useful tool to uncover the integrability of many probabilistic systems, including the Kardar-Parisi-Zhang (KPZ) equation and a number of other models in its universality class. In this paper we develop the structural theory behind half-space variants of these models and the corresponding half-space Macdonald processes. These processes are built using a Littlewood summation identity instead of the Cauchy identity, and their analysis is considerably harder than their full-space counterparts. We compute moments and Laplace transforms of observables for general half-space Macdonald measures. Introducing new dynamics preserving this class of measures, we relate them to various stochastic processes, in particular the log-gamma polymer in a half-quadrant (they are also related to the stochastic six-vertex model in a half-quadrant and the half-space ASEP). For the polymer model, we provide explicit integral formulas for the Laplace transform of the partition function. Non-rigorous saddle point asymptotics yield convergence of the directed polymer free energy to either the Tracy-Widom GOE, GSE or the Gaussian distribution depending on the average size of weights on the boundary.

Explore related subjects

Keep this discovery

BibTeXRIS

Guillaume Barraquand, Alexei Borodin, Ivan Corwin. 2018-02-22. Half-space Macdonald processes. https://doi.org/10.1017/fmp.2020.3

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