Mixture of Power Series Distributions

• Mixture of power series distributions are models based on power-series kernels (e.g. Poisson, Geometric) generating discrete count and compound continuous outcomes.
• They employ nonparametric maximum likelihood estimation and EM-based algorithms to achieve nearly parametric convergence rates under identifiable latent structures.
• The framework supports model diagnostics and bootstrap testing while extending to multivariate and transform-based formulations with applications in reliability and count data analysis.

Mixture of power series distributions denotes a class of stochastic models organized around a power-series kernel of the form $p_k(\theta)=a_k\theta^k/A(\theta)$. In the discrete-mixture setting, a latent mixing law on $\theta$ generates count pmfs that include Poisson, Geometric, Logarithmic, and Negative Binomial mixtures; in the compounding setting, a zero-truncated power series count $N$ is combined with a continuous baseline through maxima or minima of $N$ i.i.d. variables, producing families such as normal-power series, exponentiated Weibull-power series, and Gompertz-power series models. Across these formulations, the central themes are identifiability, tractable generators $A$ or $C$, nonparametric maximum likelihood estimation, EM-based computation, and the interaction between latent count structure and tail or hazard behavior (Balabdaoui et al., 5 Sep 2025, Balabdaoui et al., 31 Jul 2025, Mahmoudi et al., 2015, Silva et al., 2012)

1. Foundational definitions and notational conventions

A univariate power series distribution with infinite support is specified by

$$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$

with

$A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$

where the parameter domain is determined by the radius of convergence. In the notation used for the recent mixture-theoretic literature, the same family is written as

$$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$

with support $\mathbb{K}=\mathbb{N}$ after reindexing if necessary (Balabdaoui et al., 5 Sep 2025).

A second convention, prevalent in the compounding literature, uses a zero-truncated power series law for a latent count $\theta$0: $\theta$1 where

$\theta$2

This convention is tailored to random-sample-size constructions such as maxima and minima of $\theta$3 i.i.d. baseline variables (1212.5613).

The standard examples recur across both conventions. For infinite-support count kernels, Poisson satisfies $\theta$4 and $\theta$5; Geometric on $\theta$6 can be reparameterized by $\theta$7, giving $\theta$8 and $\theta$9; Negative Binomial with fixed $N$0 has $N$1 and $N$2 (Balabdaoui et al., 5 Sep 2025). In the zero-truncated setting, the same generator mechanism yields truncated Geometric, truncated Poisson, Logarithmic, Binomial, and truncated Negative Binomial families, all of which admit explicit $N$3, $N$4, and often $N$5 and $N$6 (Mahmoudi et al., 2015).

This suggests that the phrase “mixture of power series distributions” names a construction principle rather than a single parametric family. The unifying object is the generator $N$7 or $N$8, which determines both the primitive count law and the analytic structure of the resulting mixture or compound model (Hu et al., 2020).

2. Discrete mixtures and multivariate conditional independence

For count data, a mixture of power series distributions is obtained by integrating the kernel against a mixing distribution $N$9 or $N$0. In the univariate case,

$N$1

and observations $N$2 are i.i.d. from the true pmf $N$3 (Balabdaoui et al., 31 Jul 2025).

The multivariate extension emphasized in recent work imposes conditional independence. For $N$4 and latent parameter $N$5,

$N$6

and the mixture pmf becomes

$N$7

The data are i.i.d. from $N$8 for an unknown mixing distribution $N$9 (Balabdaoui et al., 5 Sep 2025).

The main structural assumptions in this framework are explicit. They include compact support for $A$0 relative to the radius of convergence, separation from degeneracy near the zero vector, a tail lower bound on the coefficients $A$1, and existence of the ratio limit $A$2. Under these conditions, the mixing distribution is identifiable from the mixed pmf. The multivariate proof reduces equality of pmfs to equality of mixed moments on a compact set and then invokes uniqueness of moment generating functions (Balabdaoui et al., 5 Sep 2025).

The conditional independence formulation places this literature at the intersection of two strands. One strand studies multivariate mixtures with unspecified component distributions under conditional independence, as in work by Hall and Zhou, Allman, Matias, and Rhodes, and Chauveau et al. The other is the classical nonparametric mixture framework associated with Lindsay, where components are parametric and the mixing law is unspecified (Balabdaoui et al., 5 Sep 2025). In the PSD setting, the conditional independence assumption provides a parsimonious route to multivariate count modeling while preserving the algebraic tractability of the underlying power series kernels.

3. Nonparametric estimation and convergence theory

The central estimator for PSD mixtures is the nonparametric maximum likelihood estimator (NPMLE). For count mixtures it maximizes

$A$3

and induces the fitted pmf $A$4 (Balabdaoui et al., 31 Jul 2025). In the multivariate conditionally independent case, the likelihood is

$A$5

with fitted pmf $A$6 (Balabdaoui et al., 5 Sep 2025).

Standard results due to Laird and Lindsay imply existence of the NPMLE in the multivariate framework and discreteness of the maximizing mixing distribution, with number of support points no greater than the number of distinct observations (Balabdaoui et al., 5 Sep 2025). In the univariate PSD setting, existence and uniqueness are established under mild assumptions (Balabdaoui et al., 31 Jul 2025).

The main rate results are nearly parametric in Hellinger distance. For multivariate PSD mixtures under conditional independence and fixed $A$7,

$A$8

For univariate PSD mixtures with infinite support,

$A$9

The multivariate result is dimension-explicit and can accommodate $C$0 up to order $C$1 with $C$2, at the price of additional logarithmic factors (Balabdaoui et al., 5 Sep 2025, Balabdaoui et al., 31 Jul 2025).

Two further estimators attain the exact parametric rate $C$3 in $C$4-type metrics. The first is a weighted least squares estimator defined by projection of the empirical pmf onto the PSD mixture class with weights $C$5. The second is a hybrid estimator that uses the empirical pmf on a data-adaptive bulk region and the NPMLE in the tail. In the multivariate formulation, the hybrid replaces the empirical pmf beyond a cutoff $C$6 chosen so that the fitted tail mass is at most $C$7; in the univariate formulation, the analogous threshold is $C$8. Both constructions achieve

$C$9

for the ranges of $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$0 stated in the respective theorems (Balabdaoui et al., 5 Sep 2025, Balabdaoui et al., 31 Jul 2025).

A notable asymmetry remains between Hellinger and $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$1 theory. The univariate paper records minimax lower bounds, derived from Polyanskiy and Wu for Poisson mixtures, indicating that a logarithmic inflation in Hellinger risk cannot in general be removed. At the same time, simulations in both the univariate and multivariate studies suggest that the NPMLE itself often exhibits empirical $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$2-behavior in $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$3 and $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$4, and sometimes appears nearly parametric even in Hellinger. A formal proof of parametric $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$5 rates for the NPMLE in these infinite-support PSD settings remains open (Balabdaoui et al., 31 Jul 2025).

4. Model checking, bootstrap testing, and computation

The conditional independence assumption is not taken as automatic. In the multivariate PSD framework, the null hypothesis is that the data arise from a conditionally independent PSD mixture,

$$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$6

and the alternative is residual dependence after conditioning on the latent variable (Balabdaoui et al., 5 Sep 2025).

The proposed test compares the constrained NPMLE $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$7 to the empirical pmf $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$8. The distance $$P(X=k\mid \theta)=\frac{a_k\,\theta^k}{A(\theta)},\qquad k\in\mathbb{N},$$9 can be Hellinger,

$A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$0

or an $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$1 or $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$2 discrepancy. Under the null, $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$3 should track $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$4; under the alternative, the model constraint induces systematic deviation. Calibration is bootstrap-based: generate samples i.i.d. from $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$5, recompute the constrained NPMLE and empirical pmf, form bootstrap distances $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$6, and reject if $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$7 exceeds the empirical $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$8-quantile (Balabdaoui et al., 5 Sep 2025).

The reported behavior is diagnostically strong. In simulations for bivariate Poisson mixtures built through a shared latent Poisson component with dependence parameter $A(\theta)=\sum_{k=0}^{\infty} a_k\,\theta^k,$9, and for bivariate Geometric mixtures coupled through a Gumbel copula with parameter $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$0, rejection rates exceed $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$1 for moderately strong dependence, specifically $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$2 or $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$3, at $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$4 (Balabdaoui et al., 5 Sep 2025).

The computational architecture of these models is mixture-specific rather than generic. For the multivariate NPMLE, one algorithm combines convex optimization over mixing proportions via a quadratic Taylor expansion and nonnegative least squares under simplex constraints with a gradient function

$$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$5

New support points are proposed from a random grid derived from normalized ratios $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$6, refined by the Modal EM algorithm, and weights are updated by nonnegative least squares (Balabdaoui et al., 5 Sep 2025). In the univariate weighted least squares setting, support-reduction algorithms minimize a truncated quadratic criterion and iteratively add or remove support points using the directional derivative

$$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$7

This produces finite-dimensional quadratic programs with simplex constraints (Balabdaoui et al., 31 Jul 2025).

5. Compounded continuous-baseline families

A second major meaning of mixture of power series distributions arises when a zero-truncated power series count $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$8 controls the number of i.i.d. baseline variables. If $$f_\theta(k)=\frac{b_k\,\theta^k}{b(\theta)},\qquad b(\theta)=\sum_{k=0}^{\infty} b_k\,\theta^k,$$9 is a continuous baseline cdf with pdf $\mathbb{K}=\mathbb{N}$0, the maximum-compound construction yields

$\mathbb{K}=\mathbb{N}$1

whereas the minimum-compound construction yields

$\mathbb{K}=\mathbb{N}$2

with $\mathbb{K}=\mathbb{N}$3 (Mahmoudi et al., 2015, Jafari et al., 2015).

The normal-power series class is a canonical maximum-compound example. If $\mathbb{K}=\mathbb{N}$4 are i.i.d. $\mathbb{K}=\mathbb{N}$5, $\mathbb{K}=\mathbb{N}$6 is independent and zero-truncated PS, and $\mathbb{K}=\mathbb{N}$7, then with $\mathbb{K}=\mathbb{N}$8,

$\mathbb{K}=\mathbb{N}$9

Geometric-normal, Poisson-normal, Binomial-normal, and Negative-Binomial-normal are obtained by substituting the corresponding generators $\theta$00. The class contains the normal distribution as a limit when $\theta$01 for the standard PSDs with first positive coefficient at index $\theta$02 (Mahmoudi et al., 2015).

Reliability and survival analysis mostly use the minimum-compound form. The exponentiated Weibull-power series class has

$\theta$03

with exponentiated Weibull baseline $\theta$04. By varying the PSD generator, one obtains the exponentiated Weibull-geometric, -Poisson, -Binomial, and -Logarithmic models. The reported hazard shapes include increasing, decreasing, bathtub-shaped, and unimodal forms (1212.5613).

This compounding principle has been extended systematically. The generalized Gompertz-power series class uses maxima of generalized Gompertz variables and yields increasing, decreasing, or bathtub-shaped hazards; the Gompertz-power series class uses minima of Gompertz variables and similarly supports increasing or bathtub-shaped hazards; the exponentiated extended Weibull-power series and extended Weibull-power series classes unify large families of submodels, including generalized exponential-power series, generalized modified Weibull-power series, generalized Gompertz-power series, and complementary extended Weibull-power series (Tahmasebi et al., 2015, Jafari et al., 2015, Tahmasebi et al., 2015, Silva et al., 2012).

Bivariate compounding is also available. The bivariate generalized exponential-power series class compounds a Marshall–Olkin-type bivariate generalized exponential baseline through maxima. Its joint cdf is

$\theta$05

and the model preserves a singular component on the diagonal through the parameter $\theta$06. A subtle but important point is that setting $\theta$07 removes the singular part, but independence occurs only for the un-compounded baseline $\theta$08; under nontrivial PS compounding, dependence can remain through the shared random count $\theta$09 (Jafari et al., 2015).

Inference in these continuous compounded families is typically EM-based. The latent variable is the unobserved count $\theta$10, and the E-step uses posterior expectations of the form

$\theta$11

where $\theta$12 is either $\theta$13, $\theta$14, or a baseline-specific transformation, depending on whether the construction is based on maxima or minima (1212.5613, Tahmasebi et al., 2015).

6. Transform formulations, applications, and current limitations

A related but distinct line of work studies power-mixture equations in transform space. If $\theta$15 has a PSD-type law, then its pgf can be written as

$\theta$16

and random-sum transforms take the form

$\theta$17

with $\theta$18 the pgf of $\theta$19. For the distributional fixed-point equation $\theta$20, the corresponding Laplace–Stieltjes transform relation is

$\theta$21

This is nonlinear in transform space and differs conceptually from ordinary density-level mixtures $\theta$22. The characterization results in this framework establish uniqueness under conditions such as $\theta$23 together with finite-moment assumptions on the mixing variables (Hu et al., 2020).

Representative applications span both discrete and continuous domains.

Domain	Model class	Reported outcome
Worldwide earthquakes, 1900–2021	Poisson mixture NPMLE	Superior Hellinger and $\theta$24 performance in 2-fold cross-validation (Balabdaoui et al., 31 Jul 2025)
Vélib Paris bike-sharing	Two-dimensional Poisson mixture under conditional independence	NPMLE outperformed empirical and hybrid estimators; bootstrap test detected strong nighttime dependence and no daytime rejection in one scenario (Balabdaoui et al., 5 Sep 2025)
UEFA Champions League goal times	Bivariate generalized exponential-power series	BGEL achieved the best AIC and AICC among considered models (Jafari et al., 2015)

The Vélib study is particularly instructive because it combines estimation and model criticism. For the pair “12 p.m. Saturday vs 12 p.m. Sunday,” two-fold cross-validation repeated 1000 times gave unscaled Hellinger distances $\theta$25 for the empirical and hybrid estimators and $\theta$26 for the NPMLE; the corresponding $\theta$27 distances were $\theta$28, $\theta$29, and $\theta$30; the $\theta$31 distances were $\theta$32, $\theta$33, and $\theta$34. For “1 a.m. vs 5 a.m. Monday,” all three bootstrap p-values were $\theta$35, while for “1 p.m. vs 5 p.m. Monday” the reported p-values were $\theta$36, $\theta$37, and $\theta$38 for Hellinger, $\theta$39, and $\theta$40, respectively (Balabdaoui et al., 5 Sep 2025).

Several limitations are explicit in the current literature. In multivariate count mixtures, entropy terms degrade the rate as dimension grows, so $\theta$41 should increase slowly, typically no faster than $\theta$42 (Balabdaoui et al., 5 Sep 2025). In univariate infinite-support mixtures, the logarithmic factor in Hellinger convergence appears intrinsic at least for Poisson mixtures (Balabdaoui et al., 31 Jul 2025). For dependent multivariate mixtures beyond conditional independence, copula-based constructions are possible in simulations, but new proofs would be required because the existing arguments exploit pmf factorization and truncation bounds (Balabdaoui et al., 5 Sep 2025). A further limitation, common to nonparametric mixture theory, is that favorable rates for the mixed pmf do not automatically transfer to the mixing distribution itself, whose estimation is generally much harder (Balabdaoui et al., 5 Sep 2025).

In this sense, mixtures of power series distributions occupy a broad methodological territory. They provide count-mixture models with identifiable latent heterogeneity, random-sample-size compounds with analytically tractable reliability structure, and transform-based fixed-point equations with sharp uniqueness theory. Their common algebraic core is the power-series generator, but their statistical manifestations differ substantially between density-level mixing, max/min compounding, and transform-level power mixtures.