Dispersion Function¶
The convex location-indexed functional \(D_X(u)=\mathbb{E}|X-u|\), whose slopes recover an integrable real distribution.
Core Idea¶
For an integrable real random variable \(X\), the dispersion function is
It turns one distribution into an entire location-indexed curve: at every proposed reference point \(u\), the curve reports expected absolute distance from that point. Muñoz-Pérez and Sánchez-Gómez introduced this named functional as a characterization of a distribution and as a basis for comparing dispersion. The crucial identity is stronger than “another variability measure.” Convexity and the one-sided slopes preserve the whole cumulative distribution:
Scope of Application¶
The primary scope is univariate probability theory and mathematical statistics for laws with finite first moment. It provides a representation of distributions, a graphical absolute-distance profile, a route to medians, and an object for studying spread comparisons. The original paper explicitly establishes distribution characterization and an induced dispersive ordering.
In stochastic-order theory, the curve belongs among integrated-distribution transforms used to compare laws beyond their means. Shaked and Shanthikumar document stochastic orders as tools for uncertainty comparison and for structural analysis of stochastic systems.
Clarity¶
The name separates three information levels. A mean gives one location number. Mean absolute deviation gives one spread number relative to a selected center. The dispersion function records expected absolute deviation from every center, thereby retaining the entire CDF. This explains why two laws can share mean and mean absolute deviation yet have different dispersion functions.
Manages Complexity¶
A probability law may require a density, a mass function, or a mixture of both. The dispersion function represents all three through one finite convex curve. Its geometry compresses multiple tasks: slopes give probabilities, kinks give atoms, minima give medians, and tail intercepts give the mean. This is useful when convex analysis is more tractable than manipulating a distribution measure directly.
Abstract Reasoning¶
Characterization: equal dispersion functions imply equal one-sided derivatives and hence equal CDFs. Location: any minimizer of a convex \(D_X\) satisfies a zero-in-subgradient condition, which is exactly the median condition \(F_X(u-)\le1/2\le F_X(u)\). Atom detection: \(D'_{+}(u)-D'_{-}(u)=2P(X=u)\). Translation: for \(Y=X+a\), \(D_Y(u)=D_X(u-a)\). Scaling: for real \(b\), \(D_{bX}(u)=|b|D_X(u/b)\) when \(b\ne0\). These relations can be checked without assuming a density.
Knowledge Transfer¶
Within probability and statistics, the full object transfers from distribution characterization to robust location, empirical absolute-loss curves, and stochastic comparison. The equations survive unchanged. A sample version \(n^{-1}\sum_i|X_i-u|\) approximates the population curve and makes the geometry visible, although inferential guarantees need their own assumptions.
Outside those fields, absolute-loss minimization and convexity transfer through existing abstractions such as prime:expected_value, but “dispersion function” does not. The same phrase also denotes unrelated objects in waves and plasma physics, demonstrating that lexical travel is not structural recurrence.
Relationships to Other Abstractions¶
Current abstraction Dispersion Function Domain-specific
Parents (1) — more general patterns this builds on
-
Dispersion Function presupposes Expected Value Prime
The dispersion function uses
prime:expected_value: for each \(u\), it averages the random quantity \(|X-u|\) against the probability measure.
Hierarchy paths (3) — routes to 2 parentless roots
- Dispersion Function → Expected Value → Aggregation → Micro Macro Linkage
- Dispersion Function → Expected Value → Probability → Measure → Set and Membership
- Dispersion Function → Expected Value → Probability → Measure → Aggregation → Micro Macro Linkage
Neighborhood in Abstraction Space¶
Dispersion Function sits in a sparse region of the domain-specific corpus (71st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Doob Decomposition Theorem — 0.88
- Hausdorff Space — 0.85
- Proper Convex Function — 0.84
- Compact Operator — 0.84
- Probability Bounds Analysis — 0.83
Computed from structural-signature embeddings · 2026-09-08