SearcharxivSearch

arXiv · 0806.2724

Conditionally identically distributed species sampling sequences

Abstract

Conditional identity in distribution (Berti et al. (2004)) is a new type of dependence for random variables, which generalizes the well-known notion of exchangeability. In this paper, a class of random sequences, called Generalized Species Sampling Sequences, is defined and a condition to have conditional identity in distribution is given. Moreover, a class of generalized species sampling sequences that are conditionally identically distributed is introduced and studied: the Generalized Ottawa sequences (GOS). This class contains a '`randomly reinforced'' version of the Pólya urn and of the Blackwell-MacQueen urn scheme. For the empirical means and the predictive means of a GOS, we prove two convergence results toward suitable mixtures of Gaussian distributions. The first one is in the sense of stable convergence and the second one in the sense of almost sure conditional convergence. In the last part of the paper we study the length of the partition induced by a GOS at time $n$, i.e. the random number of distinct values of a GOS until time $n$. Under suitable conditions, we prove a strong law of large numbers and a central limit theorem in the sense of stable convergence. All the given results in the paper are accompanied by some examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Federico Bassetti, Irene Crimaldi, Fabrizio Leisen. 2008-06-17. Conditionally identically distributed species sampling sequences. https://arxiv.org/abs/0806.2724

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