HackerPapers

arXiv:2602.11131physics.soc-ph

Formalization of the generalized Pareto principle and structural typicality of the 20/80-rule

Antti Hippeläinen

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We formalize a generalized form of the Pareto principle - ``fraction $p$ of inputs yields fraction $1-p$ of outputs'' - as a property of non-negative gain densities $\ell \in L^1([0,1])$, working with the decreasing rearrangement to obtain a unique characterization. For probability distributions, the resulting $p$ coincides with $1 - k_F$, where $k_F$ is the Kolkata index of the corresponding Lorenz curve. Within this framework we analyze both constructed gain densities and commonly encountered distribution families. We derive closed-form expressions for $p$ for truncated power-law, exponential, and normal distribution families. Combining these with estimates of the truncation parameter as a function of sample size $N$, we predict that datasets of size $N \in [10^2, 10^5]$ from exponential and normal families concentrate $p$ near $[0.15, 0.26]$ and $[0.20, 0.29]$ - values close to the canonical 0.2/0.8-rule, and strictly below the saturation $k \approx 0.865$ conjectured earlier by Ghosh and Chakrabarti. We discuss the implications of the structural ubiquity of Pareto-type imbalances for their use as prescriptive targets.

arXiv comments
v1: 33 pages, 10 figures v2: some additions, added references, minor revisions to formatting
Journal reference
DOI
Subjects
physics.soc-phPhysics and Society math.STStatistics Theory

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Feb 2026 to Feb 2026. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.