SearcharxivSearch

arXiv · math/0309202

Virasoro action on Schur function expansions, skew Young tableaux and random walks

Abstract

It is known that some matrix integrals over U(n) satisfy an sl(2,R)-algebra of Virasoro constraints. Acting with these Virasoro generators on 2-dimensional Schur function expansions leads to difference relations on the coefficients of this expansions. These difference relations, set equal to zero, are precisely the backward and forward equations for non-intersecting random walks. The transition probabilities for these random walks appear as the coefficients of an expansion of U(n)-matrix integrals (of the type above), by inserting in the integral the product of two Schur polynomials associated with two partitions; the latter are specified by the initial and final positions of the non-intersecting random walk. An essential ingredient in this work is the generalization of the Murnaghan-Nakayama rule to the action of Virasoro on Schur polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Adler, P. van Moerbeke. 2003-09-11. Virasoro action on Schur function expansions, skew Young tableaux and random walks. https://arxiv.org/abs/math/0309202

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