Multiplicative Random Growth¶
Core Idea¶
Multiplicative Random Growth is the process in which a positive state changes through repeated proportional shocks:
After \(n\) steps, \(X_n=X_0\prod_{i=1}^{n}R_i\). Taking logarithms turns multiplication into addition:
The log-state is therefore an additive random walk when the log-shocks are independent and identically distributed. If those increments have finite variance, their normalized sum approaches a Gaussian over long horizons, so the level state approaches a log-normal distribution. The abstraction links a local proportional update rule to a global distributional shape.
Broad Use¶
- Economics: firm, establishment, income, wealth, and city-size dynamics.
- Finance: discrete-time positive-price models and the intuition behind geometric Brownian motion.
- Biology and ecology: population, abundance, and body-size variation under proportional environmental shocks.
- Physics and chemistry: positive amplitudes or concentrations affected by repeated random gains and losses.
- Networks and information systems: multiplicative cascades, traffic volumes, and workloads driven by proportional factors.
Clarity¶
The prime separates additive from proportional disturbance. Adding ten units has the same absolute effect at every scale. Multiplying by 1.1 changes a state by ten percent, so the absolute change grows with the current level. That difference determines how uncertainty accumulates and why a population can become right-skewed even when its log-increments are symmetric.
It also separates the mechanism from its output. A log-normal cross-section is consistent with multiplicative growth but does not uniquely prove it. Selection, mixtures, boundaries, and time-varying shock laws can mimic or distort the same shape.
Manages Complexity¶
A long history of compounding shocks becomes a sum in log-space. This replaces a product of scale-dependent changes with a familiar random-walk calculation. Means and variances of log-increments can be accumulated, horizons compared, and deviations localized without following every level-path directly.
Abstract Reasoning¶
If \(Y_i=\log R_i\) has mean \(\mu\) and variance \(\sigma^2\), then [ E[\log X_n]=\log X_0+n\mu,\qquad \operatorname{Var}(\log X_n)=n\sigma^2. ] Typical log-dispersion grows like \(\sqrt n\), while the level distribution becomes increasingly asymmetric because exponentiation maps equal log deviations into unequal absolute changes. A drift in mean log-growth, a change in shock variance, or dependence between shocks produces a distinct, testable departure.
Knowledge Transfer¶
The prime transfers when three conditions survive the move: the state is positive, updates are proportional to its current level, and repeated shocks combine by multiplication. The named units can change completely. Transfer fails when increments are additive, when growth depends systematically on current size, or when births, deaths, resets, reflecting barriers, or selection dominate the distributional outcome.
Example¶
One hundred populations begin at size 1,000. Each year every population is multiplied by an independent factor whose logarithm has mean zero and a fixed variance. After many years, the populations do not cluster symmetrically around 1,000 in levels. Their log-sizes do, while level sizes form a right-skewed distribution with a few very large realizations. The skew is a consequence of multiplication and exponentiation, not evidence that large populations received larger expected percentage shocks.
Relationships to Other Abstractions¶
Current abstraction Multiplicative Random Growth Prime
Parents (1) — more general patterns this builds on
-
Multiplicative Random Growth is part of Random Walk Prime
Multiplicative Random Growth contains an additive Random Walk in log-state because logarithms turn the product of proportional shocks into their running sum.
Children (1) — more specific cases that build on this
-
Gibrat's Law Domain-specific is a decomposition of Multiplicative Random Growth
Stripping Gibrat's firm-growth framing leaves Multiplicative Random Growth's size-independent proportional shocks, log-additive random walk, and conditional log-normal limit.
Hierarchy path (1) — routes to 1 parentless root
- Multiplicative Random Growth → Random Walk → Stochastic Process
Distinction from Neighbors¶
Random Walk is the additive running-sum process contained in the log-state. Multiplicative Random Growth adds the positive level variable and exponential map. Exponential Growth uses a fixed proportional rate and is deterministic; this prime uses random proportional factors. Preferential Attachment makes expected growth depend on accumulated size, whereas the baseline here can be size-independent in percentage terms. The Central Limit Theorem explains the Gaussian limit of the summed log-shocks but does not specify the multiplicative process that generated them. A log-normal distribution is a static family; this prime is a dynamic generator.