SearcharxivSearch

arXiv · 2111.02731

A compound Poisson perspective of Ewens-Pitman sampling model

Abstract

The Ewens-Pitman sampling model (EP-SM) is a distribution for random partitions of the set $\{1,\ldots,n\}$, with $n\in\mathbb{N}$, which is index by real parameters $\alpha$ and $\theta$ such that either $\alpha\in[0,1)$ and $\theta>-\alpha$, or $\alpha<0$ and $\theta=-m\alpha$ for some $m\in\mathbb{N}$. For $\alpha=0$ the EP-SM reduces to the celebrated Ewens sampling model (E-SM), which admits a well-known compound Poisson perspective in terms of the log-series compound Poisson sampling model (LS-CPSM). In this paper, we consider a generalization of the LS-CPSM, which is referred to as the negative Binomial compound Poisson sampling model (NB-CPSM), and we show that it leads to extend the compound Poisson perspective of the E-SM to the more general EP-SM for either $\alpha\in(0,1)$, or $\alpha<0$. The interplay between the NB-CPSM and the EP-SM is then applied to the study of the large $n$ asymptotic behaviour of the number of blocks in the corresponding random partitions, leading to a new proof of Pitman's $\alpha$ diversity. We discuss the proposed results, and conjecture that analogous compound Poisson representations may hold for the class of $\alpha$-stable Poisson-Kingman sampling models, of which the EP-SM is a noteworthy special case.

Explore related subjects

Keep this discovery

BibTeXRIS

Emanuele Dolera, Stefano Favaro. 2021-11-04. A compound Poisson perspective of Ewens-Pitman sampling model. https://arxiv.org/abs/2111.02731

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