SearcharxivSearch

arXiv · 1812.07204

Some algebraic structures in KPZ universality

Abstract

We review some algebraic and combinatorial structures that underlie models in the KPZ universality class.Emphasis is placed on the Robinson-Schensted-Knuth correspondence and its geometric lifting due to A.N.Kirillov. We present how these combinatorial constructions are used to analyse the structure of solvable models in the KPZ class and lead to computation of their statistics via connecting to representation theoretic objects such as Schur, Macdonald and Whittaker functions, Young tableaux and Gelfand-Tsetlin patterns. We also present how fundamental representation theoretic concepts, such as the Cauchy identity, the Pieri rule and the branching rule, can be used, alongside RSK correspondences, and can be combined with probabilistic ideas, in order to construct integrable stochastic dynamics on two dimensional arrays of Gelfand-Tsetlin type, in ways that couple different one dimensional stochastic processes. For example, interacting particle systems, on the one hand, and processes related to eigenvalues of random matrices, on the other, thus illuminating the emergence of random matrix distributions in interacting stochastic processes. The goal of the notes is to expose some of the overarching principles, which have driven a significant number of developments in the field.

Explore related subjects

Keep this discovery

BibTeXRIS

Nikos Zygouras. 2018-12-18. Some algebraic structures in KPZ universality. https://arxiv.org/abs/1812.07204

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