Search arXivSearch

arXiv · 1301.7017

Random matrix minor processes related to percolation theory

Abstract

This paper studies a number of matrix models of size n and the associated Markov chains for the eigenvalues of the models for consecutive n's. They are consecutive principal minors for two of the models, GUE with external source and the multiple Laguerre matrix model, and merely properly defined consecutive matrices for the third one, the Jacobi-Pineiro model; nevertheless the eigenvalues of the consecutive models all interlace. We show: (i) For each of those finite models, we give the transition probability of the associated Markov chain and the joint distribution of the entire interlacing set of eigenvalues; we show this is a determinantal point process whose extended kernels share many common features. (ii) To each of these models and their set of eigenvalues, we associate a last-passage percolation model, either finite percolation or percolation along an infinite strip of finite width, yielding a precise relationship between the last passage times and the eigenvalues. (iii) Finally it is shown that for appropriate choices of exponential distribution on the percolation, with very small means, the rescaled last passage times lead to the Pearcey process; this should connect the Pearcey statistics with random directed polymers.

Explore related subjects

Keep this discovery

BibTeXRIS

Mark Adler, Pierre van Moerbeke, Dong Wang. 2013-01-29. Random matrix minor processes related to percolation theory. https://arxiv.org/abs/1301.7017

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