An easily verifiable dispersion order for discrete distributions
Andreas Eberl, Bernhard Klar, Alfonso Suárez-Llorens
TL;DR
This work addresses the limitations of the classical dispersive order for discrete distributions by introducing a weaker, practically applicable weak dispersive order based on the Lévy concentration function $Q_X(\varepsilon)$. It formalizes both the order and a family of concentration-based variability measures $\nu_r(X)$ and $\nu_{\text{rob}}(X)$ that satisfy the Bickel–Lehmann axioms and respect the weak dispersive relation, linking to majorization and entropy concepts. The paper proves that $F \leq_{disp}^{\land\text{-disc}} G$ implies $F \leq_{wd} G$, yet the weak order is strictly weaker, and provides empirical illustrations showing when wd-based conclusions align or diverge from traditional dispersion measures. Overall, the approach broadens the toolkit for comparing dispersion in discrete data and suggests robust, interpretable alternatives for applied statistics, with potential extensions to multivariate settings and deeper theoretical connections between concentration and variability.
Abstract
Dispersion is a fundamental concept in statistics, yet standard approaches - especially via stochastic orders - face limitations in the discrete setting. In particular, the classical dispersive order, well-established for continuous distributions, becomes overly restrictive for discrete random variables due to support inclusion requirements. To address this, we propose a novel weak dispersive order for discrete distributions. This order retains desirable properties while relaxing structural constraints, thereby broadening applicability. We further introduce a class of variability measures based on probability concentration, offering robust and interpretable alternatives that conform to classical axioms. Empirical illustrations highlight the practical relevance of this framework.
