SearcharxivSearch

arXiv · 1008.2821

Complex Brownian Motion Representation of the Dyson Model

Abstract

Dyson's Brownian motion model with the parameter $β=2$, which we simply call the Dyson model in the present paper, is realized as an $h$-transform of the absorbing Brownian motion in a Weyl chamber of type A. Depending on initial configuration with a finite number of particles, we define a set of entire functions and introduce a martingale for a system of independent complex Brownian motions (CBMs), which is expressed by a determinant of a matrix with elements given by the conformal transformations of CBMs by the entire functions. We prove that the Dyson model can be represented by the system of independent CBMs weighted by this determinantal martingale. From this CBM representation, the Eynard-Mehta-type correlation kernel is derived and the Dyson model is shown to be determinantal. The CBM representation is a useful extension of $h$-transform, since it works also in infinite particle systems. Using this representation, we prove the tightness of a series of processes, which converges to the Dyson model with an infinite number of particles, and the noncolliding property of the limit process.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Makoto Katori, Hideki Tanemura. 2013-01-15. Complex Brownian Motion Representation of the Dyson Model. https://doi.org/10.1214/ecp.v18-2554

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