Negative Binomial Order Statistics

• Negative binomial order statistics are the ranked values from iid negative binomial variables, used to flexibly model count data with varying dispersion.
• The distributional theory employs binomial-sum representations with incomplete-beta functions to derive CDFs and PMFs for the order statistics.
• Extensions such as the negative-binomial distribution of order k and q-negative binomial models address waiting-time problems and overlapping run scenarios in counts.

Searching arXiv for the cited papers and closely related terminology. Negative binomial order statistics are the order statistics obtained from independent and identically distributed negative binomial random variables, most commonly the $r$-th smallest value $X_{(r)}$ among $D$ iid draws from a negative binomial parent law. In recent probabilistic modeling, they are used to represent observed counts as a minimum, median, maximum, or other order statistic of latent iid counts, especially to model conditional underdispersion that is difficult to capture with a Poisson likelihood (Lederman et al., 11 Jul 2025). A closely related but distinct line of work studies the negative-binomial distribution of order $k$, which is a waiting-time distribution for runs in Bernoulli sequences rather than an order statistic of iid negative binomial draws; its mode theory has been developed in detail (Georghiou et al., 2017). A further generalization replaces iid Bernoulli trials by a $q$-Bernoulli scheme with geometrically varying success probabilities, producing several $q$-negative binomial distributions of order $k$ (Oh, 2022).

1. Terminological scope and neighboring usages

The phrase “negative binomial order statistics” is used most directly for order statistics of iid negative binomial variables, but adjacent literature uses “order” in a different sense to denote waiting-time laws associated with runs of successes. The distinction is structural rather than cosmetic: the first construction transforms a parent count distribution by ranking iid samples, whereas the second defines a count through the occurrence time of combinatorial patterns in Bernoulli trials (Lederman et al., 11 Jul 2025).

Usage	Defining object	Representative source
Negative binomial order statistic	$X_{(r)}$, the $r$-th smallest of $D$ iid negative binomial draws	(Lederman et al., 11 Jul 2025)
Negative-binomial distribution of order $X_{(r)}$0, type I	Waiting time on support $X_{(r)}$1	(Georghiou et al., 2017)
$X_{(r)}$2-negative binomial distributions of order $X_{(r)}$3	Waiting times under geometrically varying success probabilities	(Oh, 2022)

A common terminological confusion is to identify the “negative-binomial distribution of order $X_{(r)}$4” with an order statistic of a negative binomial sample. The sources distinguish them sharply. The order-statistic construction starts from iid $X_{(r)}$5 variables and then ranks them. The order-$X_{(r)}$6 constructions start from binary trial sequences and count the trial at which the $X_{(r)}$7-th run event occurs. This suggests that “order” refers to ranking in one literature and to run length or pattern structure in the other.

2. Distributional theory for iid negative binomial order statistics

In the formulation developed for count modeling, $X_{(r)}$8 denotes the usual “count-of-failures” negative binomial with shape parameter $X_{(r)}$9 and failure probability $D$0, with

$D$1

Fix $D$2 and $D$3, let $D$4 be iid $D$5, and write

$D$6

for their order statistics. The object of interest is

$D$7

Its distribution admits the standard binomial-sum representation

$D$8

where the parent CDF has the incomplete-beta representation

$D$9

The pmf then follows by differencing: $k$0

The same framework gives a joint density for the full vector of order statistics on $k$1: $k$2 Within the modeling program of discrete order statistics, these formulas make the negative binomial order statistic accessible through the parent negative binomial CDF and its incomplete-beta form (Lederman et al., 11 Jul 2025).

3. Moments, dispersion, and the underdispersion mechanism

Closed-form elementary expressions for the first two moments are not available in finite terms, but both moments admit summation formulas in terms of the CDF of $k$3. Defining

$k$4

and

$k$5

one has

$k$6

In practice, the infinite sums are truncated at $k$7 large enough that $k$8 (Lederman et al., 11 Jul 2025).

The principal dispersion summary is the index of dispersion

$k$9

As $q$0, which is the Poisson limit of the negative binomial, the index converges to

$q$1

For fixed $q$2 and large $q$3, the limiting constant depends only on $q$4 and scales like $q$5. The source states that by changing $q$6 one can achieve arbitrarily large overdispersion, and by choosing $q$7 one can dial in a lower bound on underdispersion. For the median, with $q$8 and odd $q$9, $q$0 is nonincreasing in $q$1, so larger $q$2 yields more underdispersion (Lederman et al., 11 Jul 2025).

This mechanism is central to the modeling motivation. The Poisson distribution is the default choice of likelihood for probabilistic models of count data, but its equidispersion constraint can make predictive uncertainty artificially inflated. Order-statistic models alter dispersion without abandoning a standard parent count law. A plausible implication is that they supply a structured route from ordinary count likelihoods to more regular conditional behavior by compressing latent variability through ranking rather than by modifying only the parent variance function.

4. Latent-variable construction, inference, and computational structure

To embed negative binomial order statistics in hierarchical models, latent parent draws are introduced. For each observed count $q$3, one posits latent variables $q$4 and uses the complete-conditional factor

$q$5

The resulting augmentation is designed to be modular with existing tools tailored to the parent distribution (Lederman et al., 11 Jul 2025).

Sampling the latent $q$6's is carried out by an exact $q$7 algorithm based on three-way indicators

$q$8

together with sufficient statistics

$q$9

up to step $k$0. The procedure sequentially draws $k$1 from a three-category distribution whose weights are ratios of partial order-statistic CDFs. Given $k$2, one samples $k$3 from the negative binomial truncated to the appropriate region, and the loop may stop early if break-conditions on $k$4 are satisfied.

Once $k$5 has been completed, the latent draws are iid $k$6, so standard negative-binomial augmentations become available. In particular, the “CRT + Poisson” augmentation gives

$k$7

with marginal

$k$8

Summing over $k$9 yields

$X_{(r)}$0

The corresponding Gibbs updates are

$X_{(r)}$1

$X_{(r)}$2

If $X_{(r)}$3 itself is random, with a prior such as shifted-Binomial or “OddBinomial,” its complete-conditional is proportional to

$X_{(r)}$4

Several practical heuristics are emphasized. “Median” order statistics, with $X_{(r)}$5, tend to be most symmetric and concentrate around the negative binomial mean; they can be viewed as a discrete analog of location-scale families. Min and Max models yield heavy one-sided skew, and MaxOS admits a shortcut in sparse data because $X_{(r)}$6 forces all $X_{(r)}$7's to be $X_{(r)}$8. Worst-case sampling cost is $X_{(r)}$9 per data point, but break-conditions often halt the loop early. Because inference re-uses standard conjugacies for negative binomial or Poisson models, regression on $r$0 or $r$1, random effects, factor models, and spatio-temporal structure can be added by incorporating the $r$2- and $r$3-augmentations. The framework has been illustrated on commercial flight times, COVID-19 case counts, Finnish bird abundance, and RNA sequencing data (Lederman et al., 11 Jul 2025).

5. Negative-binomial distributions of order $r$4: type I and mode theory

The negative-binomial distribution of order $r$5, type I, is a natural generalization of the ordinary negative binomial, recovered by setting $r$6, and of the geometric distribution of order $r$7, recovered by setting $r$8. Here $r$9 and $D$0 are fixed positive integers, $D$1, and $D$2. A discrete random variable $D$3 has this distribution if its support is

$D$4

and its pmf is

$D$5

By convention $D$6 for $D$7, and

$D$8

This law is a waiting-time distribution rather than an order statistic of iid negative binomial samples (Georghiou et al., 2017).

Its analysis is based on the recurrence, valid for $D$9,

$X_{(r)}$00

Together with the initial conditions $X_{(r)}$01 for $X_{(r)}$02 and $X_{(r)}$03, this recurrence completely determines the sequence $X_{(r)}$04. Let $X_{(r)}$05 denote any mode, that is, any value $X_{(r)}$06 at which $X_{(r)}$07 attains its global maximum. Substituting $X_{(r)}$08 into the recurrence yields the upper bound

$X_{(r)}$09

When $X_{(r)}$10, the upper bound collapses to $X_{(r)}$11, and since necessarily $X_{(r)}$12, one obtains the exact identity

$X_{(r)}$13

Thus the geometric distribution of order $X_{(r)}$14 always has its maximum exactly at $X_{(r)}$15 (Georghiou et al., 2017).

A complementary lower bound is obtained by studying successive differences $X_{(r)}$16. For $X_{(r)}$17 and $X_{(r)}$18, the lower bound takes the form

$X_{(r)}$19

where $X_{(r)}$20 is the larger real root of a quadratic $X_{(r)}$21 whose leading coefficient is $X_{(r)}$22. The source states that the upper and lower bounds “pinch” the mode between two explicit integers and often coincide, yielding an exact formula. In the special case $X_{(r)}$23, the mode can indeed be written in closed form: $X_{(r)}$24 where

$X_{(r)}$25

The exceptional $X_{(r)}$26 reflects a flat region at $X_{(r)}$27 when $X_{(r)}$28.

Distributions of order $X_{(r)}$29 arise naturally whenever one counts overlapping runs or patterns in sequences of Bernoulli trials. The source notes applications in designing acceptance-sampling plans, computing confidence intervals in runs-based tests, and sensitive-survey methodology where runs-of-successes are censored. In that setting, locating the mode is operationally important because it identifies the most-likely count and can guide thresholds, control-limits, or penalty levels (Georghiou et al., 2017).

6. $X_{(r)}$30-negative binomial distributions of order $X_{(r)}$31 and generalized run schemes

A further branch of the subject studies variations of negative-binomial-of-order-$X_{(r)}$32 waiting-time laws under a $X_{(r)}$33-Bernoulli trial model. In this scheme, the probability of success in the $X_{(r)}$34-st trial depends on the number of failures already observed: $X_{(r)}$35 with $X_{(r)}$36 and $X_{(r)}$37. As $X_{(r)}$38, the model collapses to iid Bernoulli$X_{(r)}$39, and one recovers the classical negative-binomial-of-order-$X_{(r)}$40 distributions (Oh, 2022).

The literature distinguishes four main types, together with an $X_{(r)}$41-overlapping generalization.

Model	Interpretation	Support
$X_{(r)}$42	$X_{(r)}$43-th non-overlapping run of $X_{(r)}$44 successes	$X_{(r)}$45
$X_{(r)}$46	$X_{(r)}$47-th run of length at least $X_{(r)}$48	$X_{(r)}$49
$X_{(r)}$50	$X_{(r)}$51-th overlapping run of length $X_{(r)}$52	$X_{(r)}$53
$X_{(r)}$54	$X_{(r)}$55-th run of exactly $X_{(r)}$56 successes	$X_{(r)}$57
$X_{(r)}$58	$X_{(r)}$59-th $X_{(r)}$60-overlapping run	$X_{(r)}$61

Each type has a combinatorial kernel: $X_{(r)}$62 for non-overlapping runs, $X_{(r)}$63 for runs of length at least $X_{(r)}$64, $X_{(r)}$65 for overlapping runs, $X_{(r)}$66 for runs of exactly $X_{(r)}$67, and $X_{(r)}$68 for the $X_{(r)}$69-overlapping generalization. These kernels admit “add one more cell” recurrences of the generic form

$X_{(r)}$70

The associated pmfs are expressed as combinatorial sums whose weights combine factors of the form

$X_{(r)}$71

with additional powers of $X_{(r)}$72 determined by weighted sums of cell occupancies.

The source identifies specific authors for the various types: Yalçın-Eryilmaz (2014) for Type 1, Makri-Psillakis (2016) for Type 2, Yalçın (2013) for Type 3, Oh-Jang (2022) for Type 4, and Kinacı-Coşkun-Karakaya-Akdoğan (2016) for the $X_{(r)}$73-overlapping case. Ordinary generating functions in $X_{(r)}$74 may also be written by summing $X_{(r)}$75; by duality with $X_{(r)}$76-binomial-of-order-$X_{(r)}$77 counting distributions, these have rational forms in $X_{(r)}$78 and $X_{(r)}$79, although the source describes the combinatorial sums as the most compact closed forms. As $X_{(r)}$80, the $X_{(r)}$81-factors disappear and the models revert exactly to the classical negative binomial distributions of order $X_{(r)}$82 (Oh, 2022).

The coexistence of these frameworks clarifies the modern landscape. Negative binomial order statistics in the strict sense are rank transforms of iid negative binomial counts and are motivated by tractable modeling of dispersion, especially underdispersion. Negative-binomial distributions of order $X_{(r)}$83 and their $X_{(r)}$84-extensions are run-count waiting-time laws. The shared terminology reflects a common concern with structured count distributions, but the underlying stochastic constructions are fundamentally different.