Papers
Topics
Authors
Recent
2000 character limit reached

Iterated Lorenz Curve Mapping

Updated 17 November 2025
  • Iterated Lorenz Curve Mapping is a process that repeatedly applies the Lorenz transformation to a distribution, yielding a unique fixed point characterized by power laws.
  • The methodology involves recursive bounding and fixed-point analysis, where the distribution converges uniformly to x^φ, with φ approximating 1.618 (the golden section).
  • This mapping has practical implications in measuring income inequality, constructing robust risk measures, and analyzing network degree distributions.

The iterated Lorenz curve mapping refers to the iterative application of a Lorenz-curve transformation to a distribution function, resulting in a sequence of new probability distributions. Originating from Arnold’s definition, this map exhibits remarkable convergence properties: under general conditions, repeated application leads to a stable, nontrivial fixed-point distribution that universally emerges, independent of the initial law. In both univariate and bivariate cases, the limiting behavior involves explicit power laws governed by the golden section, with deep implications for inequality measurement, risk modeling, and network theory.

1. Formal Definition and Operator Construction

Let XX be a non-negative random variable with distribution function F(x)F(x) on [0,)[0, \infty) and finite mean μF=0(1F(u))du<\mu_F = \int_0^\infty (1 - F(u)) \, du < \infty. The (primal) Lorenz curve is the function LF:[0,1][0,1]L_F: [0,1] \rightarrow [0,1] given by

LF(p)=1μF0pF1(u)du,0p1L_F(p) = \frac{1}{\mu_F} \int_0^p F^{-1}(u) \, du, \quad 0 \leq p \leq 1

where the generalized inverse F1(u)=inf{x:F(x)u}F^{-1}(u) = \inf\{x : F(x) \geq u\} for u[0,1]u \in [0,1]. Arnold's insight is that LFL_F itself forms a distribution function on [0,1][0,1], so the mapping

L:FL[F]L: F \mapsto L[F]

defines an operator L:CDFs on [0,)CDFs on [0,1]L: \text{CDFs on } [0, \infty) \rightarrow \text{CDFs on } [0,1]. By iteratively applying LL, starting from F0=FF_0 = F, the sequence is defined recursively as

Fn+1=L[Fn],n=0,1,2,F_{n+1} = L[F_n], \qquad n = 0,1,2,\ldots

This recursive mapping—the iterated Lorenz curve mapping—produces a sequence of distribution functions with rich limiting structure (Ignatov et al., 24 Jan 2024, Yordanov, 2 Jul 2025).

2. Iterative Convergence and Fixed-Point Analysis

The main finding is that, for any initial non-negative F0F_0 with finite mean, the sequence {Fn}\{F_n\} converges uniformly on [0,1][0,1] to a unique fixed point GG satisfying the self-referential equation

G(x)=1μG0xG1(u)duG(x) = \frac{1}{\mu_G} \int_0^x G^{-1}(u) \, du

This fixed point emerges as the solution to a nonlinear functional equation, which under further analysis produces explicit power-law forms.

For the "primal" Lorenz operator, the limit is

G(x)=xφ,φ=1+521.618G(x) = x^\varphi, \quad \varphi = \frac{1+\sqrt{5}}{2} \approx 1.618

which is the golden section. The fidelity of the convergence is established via bounding sequences

{xan+1Fn(x)xan,n odd xanFn(x)xan+1,n even\begin{cases} x^{a_n+1} \leq F_n(x) \leq x^{a_n}, & n \text{ odd} \ x^{a_n} \leq F_n(x) \leq x^{a_n+1}, & n \text{ even} \end{cases}

where an+1=1+1ana_{n+1} = 1 + \frac{1}{a_n}, converging to φ\varphi. This places Fn(x)F_n(x) between two powers tending to φ\varphi, and thus FnxφF_n \to x^\varphi uniformly (Ignatov et al., 24 Jan 2024).

3. Limiting Distributions and Parent Laws

The limiting distribution has density

g(x)=ddxG(x)=φxφ1g(x) = \frac{d}{dx}G(x) = \varphi\,x^{\varphi-1}

The parent distribution from which this Lorenz law arises—obtained by inverting the Lorenz curve mapping—is the Pareto type: F(x)=1xφ,x1F(x) = 1 - x^{-\varphi}, \quad x \geq 1 with density

f(x)=φxφ1f(x) = \varphi\,x^{-\varphi-1}

Thus, both the iterated-limit curve GG and its parent FF are governed by the golden-ratio exponent.

The "reflected" Lorenz-curve operator LL'—constructed by a stationary-excess (equilibrium) transform followed by diagonal reflection: HF(p)=1μFp1F1(u)du;L[F](x)=1HF(1x)H_F(p) = \frac{1}{\mu_F}\int_p^1 F^{-1}(u)\,du;\qquad L'[F](x) = 1 - H_F(1-x) converges uniformly to

Gref(x)=1(1x)φ,φ=5120.618G_{\text{ref}}(x) = 1 - (1-x)^{\varphi'}, \quad \varphi' = \frac{\sqrt{5}-1}{2} \approx 0.618

with density

gref(x)=φ(1x)φ1g_{\text{ref}}(x) = \varphi'\,(1-x)^{\varphi'-1}

The parent law for the reflected case is also a Pareto form, with exponents φ\varphi and φ\varphi' satisfying φ=1/φ\varphi' = 1/\varphi and 1+φ=φ21+\varphi = \varphi^2.

4. Bivariate and Multivariate Extensions

Arnold’s bivariate Lorenz curve generalizes the construction for X=(X1,X2)0X=(X_1,X_2) \geq 0, with joint distribution F12F_{12} and cross-moment μ12=E[X1X2]\mu_{12} = \mathbb{E}[X_1 X_2]. The bivariate Lorenz curve is

LF12(x1,x2)=1μ12u1=0F11(x1)u2=0F21(x2)u1u2dF12(u1,u2)L_{F_{12}}(x_1, x_2) = \frac{1}{\mu_{12}} \int_{u_1=0}^{F_1^{-1}(x_1)} \int_{u_2=0}^{F_2^{-1}(x_2)} u_1 u_2 \, dF_{12}(u_1,u_2)

Bivariate iteration involves nontrivial interdependence, as the Lorenz operator affects both marginals and their dependence structure (copula). The iteration is

Ln+1(x1,x2)=1Dnu1=0Ln,11(x1)u2=0Ln,21(x2)u1u2dLn(u1,u2)L_{n+1}(x_1,x_2) = \frac{1}{D_n} \int_{u_1=0}^{L_{n,1}^{-1}(x_1)} \int_{u_2=0}^{L_{n,2}^{-1}(x_2)} u_1 u_2\,dL_n(u_1,u_2)

where DnD_n is the normalization. For marginals,

Ln+1,i(x)=1Dn0Ln,i1(x)uE[XjLnXiLn=u]duL_{n+1,i}(x) = \frac{1}{D_n}\int_0^{L_{n,i}^{-1}(x)}u\,E[X_j^{L_n}| X_i^{L_n}=u]\,du

Under positive dependence (TP2_2) or negative dependence (RR2_2), the iteration preserves TP2_2/RR2_2 and induces uniform convergence of marginals to the power law governed by the golden section, with asymptotic independence in the joint density as the copula density approaches unity away from boundaries (Yordanov, 2 Jul 2025).

5. Differential Systems, Functional Equations, and Exponent Characterization

The limiting Lorenz and reflected curves solve nontrivial functional equations arising in self-similar differential systems. Specifically,

G(x)=1μ(G1(x)),G(0)=0,G(1)=1G'(x) = \frac{1}{\mu} (G^{-1}(x)), \qquad G(0)=0,\,G(1)=1

has unique solution for the primal fixed point, and

Gref(x)=1μ(1Gref1(1x))G_{\text{ref}}'(x) = \frac{1}{\mu}(1-G_{\text{ref}}^{-1}(1-x))

for the reflected. The solution form G(x)=x1/αG(x) = x^{1/\alpha} requires α2=α+1\alpha^2 = \alpha + 1; thus the exponent is φ=1+52\varphi = \frac{1+\sqrt{5}}{2}, the golden section.

A summary table for limiting cases:

Case Limiting CDF Exponent Parent Law
Primal xφx^\varphi φ\varphi Pareto, φ-\varphi
Reflected 1(1x)φ1-(1-x)^{\varphi'} φ\varphi' Pareto, 1+φ1+\varphi
Bivariate x1/φx^{1/\varphi} 1/φ1/\varphi Asymptotic indep.

6. Applications and Contexts of Use

Iterated Lorenz curve mapping provides a universal attractor for income-inequality modeling: convex combinations of the primal and reflected limits yield exceptional fits to real-world income data (e.g., Bulgarian household incomes). The limit power laws serve as benchmark solutions for self-similar differential equations relevant in economics and dynamical systems.

In risk management, bespoke risk measures—such as GS1_1, GS2_2—are built from the area between optimal (primal/reflected) Lorenz curves and a portfolio’s actual curve. These measures interpolate smoothly among mean-variance, CVaR, mean-absolute-deviation, and Gini-difference metrics, offering robust risk-return trade-offs and improved diversification profiles.

In network science, iterated Lorenz mapping offers mechanisms by which rich-get-richer transformations lead to degree-distribution tails with Pareto exponents φ+1\varphi + 1. Connections to stochastic-order transfers and queueing-theory stationary-excess transformations contextualize the mapping within broader mathematical frameworks (Ignatov et al., 24 Jan 2024).

A plausible implication is that the iterated mapping could underlie the universality of power laws in empirical distributions arising from repeated balancing or transfer operations.

7. Mathematical Foundations and Extensions

Proofs leverage Stieltjes integration, properties of TP2_2/RR2_2 densities, fixed-point functional analysis, and contraction mapping principles. Rearrangement inequalities (Hardy–Littlewood–Pólya) facilitate explicit bounds and uniform convergence.

In the bivariate case, the mapping’s effect on dependence structure is central: under iteration, even initially dependent marginals converge to independence, with copula density tending to 1 off-set boundaries. Extension to higher dimensions and multivariate settings via copula- or zonoid-based methods is ongoing. Full generalization to the multivariate case remains an open challenge (Yordanov, 2 Jul 2025).

Common misconceptions include the belief that Lorenz curve iteration always preserves dependence or scale parameters; the developed theory demonstrates the contrary: dependence structure erodes and universal limiting forms supersede the original law’s details.


In summary, iterated Lorenz curve mapping defines a robust transformation on probability distributions, yielding universal limiting power-law forms characterized by the golden section, with extensive applications in socioeconomic modeling, risk theory, and network science. Its mathematical structure unifies approaches across distribution theory, functional analysis, and applied probability.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)
Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Forward Email Streamline Icon: https://streamlinehq.com

Follow Topic

Get notified by email when new papers are published related to Iterated Lorenz Curve Mapping.