SearcharxivSearch

arXiv · 1008.0144

Noncolliding Squared Bessel Processes

Abstract

We consider a particle system of the squared Bessel processes with index $\nu > -1$ conditioned never to collide with each other, in which if $-1 < \nu < 0$ the origin is assumed to be reflecting. When the number of particles is finite, we prove for any fixed initial configuration that this noncolliding diffusion process is determinantal in the sense that any multitime correlation function is given by a determinant with a continuous kernel called the correlation kernel. When the number of particles is infinite, we give sufficient conditions for initial configurations so that the system is well defined. There the process with an infinite number of particles is determinantal and the correlation kernel is expressed using an entire function represented by the Weierstrass canonical product, whose zeros on the positive part of the real axis are given by the particle-positions in the initial configuration. From the class of infinite-particle initial configurations satisfying our conditions, we report one example in detail, which is a fixed configuration such that every point of the square of positive zero of the Bessel function $J_{\nu}$ is occupied by one particle. The process starting from this initial configuration shows a relaxation phenomenon converging to the stationary process, which is determinantal with the extended Bessel kernel, in the long-term limit.

Explore related subjects

Keep this discovery

BibTeXRIS

Makoto Katori, Hideki Tanemura. 2010-08-01. Noncolliding Squared Bessel Processes. https://doi.org/10.1007/s10955-011-0117-y

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