SearcharxivSearch

arXiv · math/0306386

Noncolliding Brownian motions and Harish-Chandra formula

Abstract

We consider a system of noncolliding Brownian motions introduced in our previous paper, in which the noncolliding condition is imposed in a finite time interval $(0,T]$. This is a temporally inhomogeneous diffusion process whose transition probability density depends on a value of $T$, and in the limit $T \to \infty$ it converges to a temporally homogeneous diffusion process called Dyson's model of Brownian motions. It is known that the distribution of particle positions in Dyson's model coincides with that of eigenvalues of a Hermitian matrix-valued process, whose entries are independent Brownian motions. In the present paper we construct such a Hermitian matrix-valued process, whose entries are sums of Brownian motions and Brownian bridges given independently of each other, that its eigenvalues are identically distributed with the particle positions of our temporally inhomogeneous system of noncolliding Brownian motions. As a corollary of this identification we derive the Harish-Chandra formula for an integral over the unitary group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Makoto Katori, Hideki Tanemura. 2003-10-28. Noncolliding Brownian motions and Harish-Chandra formula. https://arxiv.org/abs/math/0306386

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