SearcharxivSearch

arXiv · 1703.07276

Generalized negative binomial distributions as mixed geometric laws and related limit theorems

Abstract

In this paper we study a wide and flexible family of discrete distributions, the so-called generalized negative binomial (GNB) distributions that are mixed Poisson distributions in which the mixing laws belong to the class of generalized gamma (GG) distributions. The latter was introduced by E. W. Stacy as a special family of lifetime distributions containing gamma, exponential power and Weibull distributions. These distributions seem to be very promising in the statistical description of many real phenomena being very convenient and almost universal models for the description of statistical regularities in discrete data. Analytic properties of GNB distributions are studied. A GG distribution is proved to be a mixed exponential distribution if and only if the shape and exponent power parameters are no greater than one. The mixing distribution is written out explicitly as a scale mixture of strictly stable laws concentrated on the nonnegative halfline. As a corollary, the representation is obtained for the GNB distribution as a mixed geometric distribution. The corresponding scheme of Bernoulli trials with random probability of success is considered. Within this scheme, a random analog of the Poisson theorem is proved establishing the convergence of mixed binomial distributions to mixed Poisson laws. Limit theorems are proved for random sums of independent random variables in which the number of summands has the GNB distribution and the summands have both light- and heavy-tailed distributions. The class of limit laws is wide enough and includes the so-called generalized variance gamma distributions. Various representations for the limit laws are obtained in terms of mixtures of Mittag-Leffler, Linnik or Laplace distributions. Some applications of GNB distributions in meteorology are discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

V. Yu. Korolev, A. I. Zeifman. 2017-03-21. Generalized negative binomial distributions as mixed geometric laws and related limit theorems. https://arxiv.org/abs/1703.07276

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