SearcharxivSearch

arXiv · 2102.08520

Dual process in the two-parameter Poisson-Dirichlet diffusion

Abstract

The two-parameter Poisson-Dirichlet diffusion takes values in the infinite ordered simplex and extends the celebrated infinitely-many-neutral-alleles model, having a two-parameter Poisson-Dirichlet stationary distribution. Here we identify a dual process for this diffusion and obtain its transition probabilities. The dual is shown to be given by Kingman's coalescent with mutation, conditional on a given configuration of leaves. Interestingly, the dual depends on the additional parameter of the stationary distribution only through the test functions and not through the transition rates. After discussing the sampling probabilities of a two-parameter Poisson-Dirichlet partition drawn conditionally on another partition, we use these notions together with the dual process to derive the transition density of the diffusion. Our derivation provides a new probabilistic proof of this result, leveraging on an extension of Pitman's Polya urn scheme, whereby the urn is split after a finite number of steps and two urns are run independently onwards. The proof strategy exemplifies the power of duality and could be exported to other models where a dual is available.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert C. Griffiths, Matteo Ruggiero, Dario Spanò, Youzhou Zhou. 2021-02-17. Dual process in the two-parameter Poisson-Dirichlet diffusion. https://doi.org/10.1016/j.spa.2024.104500

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