SearcharxivSearch

arXiv · 1709.10444

Random surface growth and Karlin-McGregor polynomials

Abstract

We consider consistent dynamics for non-intersecting birth and death chains, originating from dualities of stochastic coalescing flows and one dimensional orthogonal polynomials. As corollaries, we obtain unified and simple probabilistic proofs of certain key intertwining relations between multivariate Markov chains on the levels of some branching graphs. Special cases include the dynamics on the Gelfand-Tsetlin graph considered by Borodin and Olshanski and the ones on the BC-type graph recently studied by Cuenca. Moreover, we introduce a general inhomogeneous random growth process with a wall that includes as special cases the ones considered by Borodin and Kuan and Cerenzia, that are related to the representation theory of classical groups and also the Jacobi growth process more recently studied by Cerenzia and Kuan. Its most important feature is that, this process retains the determinantal structure of the ones studied previously and for the fully packed initial condition we are able to calculate its correlation kernel explicitly in terms of a contour integral involving orthogonal polynomials. At a certain scaling limit, at a finite distance from the wall, one obtains for a single level discrete determinantal ensembles associated to continuous orthogonal polynomials, that were recently introduced by Borodin and Olshanski, and that depend on the inhomogeneities.

Explore related subjects

Keep this discovery

BibTeXRIS

Theodoros Assiotis. 2019-02-14. Random surface growth and Karlin-McGregor polynomials. https://arxiv.org/abs/1709.10444

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