Search arXivSearch

arXiv · 2210.12450

Exact solution of interacting particle systems related to random matrices

Abstract

We consider one-dimensional diffusions, with polynomial drift and diffusion coefficients, so that in particular the motion can be space-inhomogeneous, interacting via one-sided reflections. The prototypical example is the well-known model of Brownian motions with one-sided collisions, also known as Brownian TASEP, which is equivalent to Brownian last passage percolation. We obtain a formula for the finite dimensional distributions of these particle systems, starting from arbitrary initial condition, in terms of a Fredholm determinant of an explicit kernel. As far as we can tell, in the space-inhomogeneous setting and for general initial condition this is the first time such a result has been proven. We moreover consider the model of non-colliding diffusions, again with polynomial drift and diffusion coefficients, which includes the ones associated to all the classical ensembles of random matrices. We prove that starting from arbitrary initial condition the induced point process has determinantal correlation functions in space and time with an explicit correlation kernel. A key ingredient in our general method of exact solution for both models is the application of the backward in time diffusion flow on certain families of polynomials constructed from the initial condition.

Explore related subjects

Keep this discovery

BibTeXRIS

Theodoros Assiotis. 2022-10-22. Exact solution of interacting particle systems related to random matrices. https://doi.org/10.1007/s00220-023-04777-8

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