Search arXivSearch

arXiv · 0707.0442

Dyson's non-intersecting Brownian motions with a few outliers

Abstract

Consider n non-intersecting particles on the real line (Dyson Brownian motions), all starting from the origin at time=0, and forced to return to x=0 at time=1. For large n, the average mean density of particles has its support, for each 0<t<1, within the interior of an ellipse. The Airy process is defined as the motion of these non-intersecting Brownian motions for large n, but viewed from an arbitrary point on the ellipse with an appropriate space-time rescaling. Assume now a finite number r of these particles are forced to a different target point. Does it affect the Brownian fluctuations along the ellipse for large n? In this paper, we show that no new process appears as long as one considers points on the ellipse, for which the t-coordinate is smaller than the t-coordinate of the point of tangency of the tangent to the curve passing through the target point. At this point of tangency the fluctuations obey a new statistics: the Airy process with r outliers (in short: {\bf r-Airy process}). The log of the transition probability of this new process is given by the Fredholm determinant of a new kernel (extending the Airy kernel) and it satisfies a non-linear PDE in x and the time.

Explore related subjects

Keep this discovery

BibTeXRIS

Mark Adler, Jonathan Delepine, Pierre van Moerbeke. 2008-11-19. Dyson's non-intersecting Brownian motions with a few outliers. https://arxiv.org/abs/0707.0442

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