Search arXivSearch

arXiv · 2409.11364

On the number of elements beyond the ones actually observed

Abstract

In this work, a variant of the birth and death chain with constant intensities, originally introduced by Bruno de Finetti way back in 1957, is revisited. This fact is also underlined by the choice of the title, which is clearly a literal translation of the original one. Characteristic of the variant is that it allows negative jumps of any magnitude. And this, as explained in the paper, might be useful in offering some insight into the issue, arising in numerous situations, of inferring the number of the undetected elements of a given population. One thinks, for example, of problems concerning abundance or richness of species. The author's purpose is twofold: to align the original de Finetti's construction with the modern, well-established theory of the continuous-time Markov chains with discrete state space and show how it could be used to make probabilistic previsions on the number of the unseen elements of a population. With the aim of enhancing the possible practical applications of the model, one discusses the statistical point estimation of the rates which characterize its infinitesimal description.

Explore related subjects

Keep this discovery

BibTeXRIS

Eugenio Regazzini. 2024-09-17. On the number of elements beyond the ones actually observed. https://arxiv.org/abs/2409.11364

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