SearcharxivSearch

arXiv · 0706.1034

Infinite-dimensional diffusions as limits of random walks on partitions

Abstract

The present paper originated from our previous study of the problem of harmonic analysis on the infinite symmetric group. This problem leads to a family {P_z} of probability measures, the z-measures, which depend on the complex parameter z. The z-measures live on the Thoma simplex, an infinite-dimensional compact space which is a kind of dual object to the infinite symmetric group. The aim of the paper is to introduce stochastic dynamics related to the z-measures. Namely, we construct a family of diffusion processes in the Toma simplex indexed by the same parameter z. Our diffusions are obtained from certain Markov chains on partitions of natural numbers n in a scaling limit as n goes to infinity. These Markov chains arise in a natural way, due to the approximation of the infinite symmetric group by the increasing chain of the finite symmetric groups. Each z-measure P_z serves as a unique invariant distribution for the corresponding diffusion process, and the process is ergodic with respect to P_z. Moreover, P_z is a symmetrizing measure, so that the process is reversible. We describe the spectrum of its generator and compute the associated (pre)Dirichlet form.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexei Borodin, Grigori Olshanski. 2008-02-24. Infinite-dimensional diffusions as limits of random walks on partitions. https://doi.org/10.1007/s00440-008-0148-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