Logistic Map Calculator (Bifurcations and Chaos)
Logistic map calculator x_{n+1} = r x_n (1-x_n): trajectories, fixed points, Feigenbaum bifurcations delta=4.6692, Lyapunov exponent and chaotic regime.
Report a calculation error
Help us improve. Describe what is wrong with the calculation.
Result
| Voce | Valore |
|---|
Show full details
Share result
Disclaimer: this calculation is for informational purposes only. For important decisions, consult a qualified professional.
The logistic map
The logistic map, studied by Robert May in 1976 in population dynamics context, is one of the most famous nonlinear recurrence equations in mathematics. Despite its apparent simplicity:
x_{n+1} = r * x_n * (1 - x_n)
displays the astonishing complexity of 'deterministic chaos': from a single parameter r emerges the whole zoo of dynamical behaviors, from stable fixed points to infinite bifurcations and chaos.
Parameter r and bifurcation diagram
As r varies in [0, 4], dynamics goes through several phases:
- 0 < r < 1: x* = 0 is unique attractor, all trajectories go to 0 (extinction).
- 1 < r < 3: x* = 1 - 1/r stable, non-trivial attractor.
- r = 3: period-doubling bifurcation. Fixed point becomes unstable, period-2 cycle emerges.
- r ~ 3.4495: period-4 bifurcation.
- r ~ 3.5440: period-8 bifurcation.
- r_infinity ~ 3.5699456...: Feigenbaum accumulation point, chaos threshold.
- 3.5699 < r <= 4: chaos with periodic windows (e.g., period 3 at r ~ 3.828).
- r = 4: complete chaos, statistically equivalent to random binary sequence.
Feigenbaum constant
Mitchell Feigenbaum (1975) discovered a remarkable result: ratios between consecutive bifurcation intervals converge to universal constant:
delta = lim (r_n - r_{n-1}) / (r_{n+1} - r_n) = 4.6692016091029906718...
UNIVERSAL: holds for all unimodal maps (single internal maximum) with period-doubling bifurcations, not just logistic. Produced 'universal theory of chaos', showing road to chaos follows precise mathematical laws independent of specific system.
Lyapunov exponent
Quantitative measure of sensitivity to initial conditions, chaos indicator:
L = lim_{N -> infinity} (1/N) * Sigma_{n=0}^{N-1} log|f'(x_n)|
with f'(x) = r * (1 - 2x).
- L < 0: regular (stable) attractor, small perturbations decay.
- L = 0: edge of chaos (bifurcation).
- L > 0: chaotic regime, small perturbations grow exponentially (butterfly effect).
For r = 4 (complete chaos): L = log(2) ~ 0.693.
Five modes
- Trajectory: explicit iteration x_0, x_1, x_2, ... for given r and x_0.
- Fixed points: solutions of x* = f(x*) and stability via f'(x*).
- Period: automatic detection of cycles of length 1, 2, 4, 8, ...
- Lyapunov exponent: numerical L estimate for regime characterization.
- Feigenbaum: universal constant and bifurcations discussion.
Sensitivity to initial conditions
Lorenz 'butterfly effect' (1961) in 1D: for r > 3.5699, two initial conditions x_0 and x_0 + delta (with small delta) produce trajectories diverging exponentially: |x_n - x'_n| ~ delta * e^(L*n). Impossible to predict long-term behavior without infinite precision initial conditions. This 'predictive horizon' is limited by initial condition measurement capacity.
Period-3 window
Surprising phenomenon: even in chaotic region r > 3.5699, 'periodicity windows' exist. Most famous is 'period-3 window' centered at r ~ 3.828. Sharkovskii-Li-Yorke theorem: if iteration has period-3 cycle, then it has cycles of EVERY period. Foundation of famous Li-Yorke 'Period Three Implies Chaos' theorem (1975).
Applications
- Biology: population dynamics (May 1976 model), epidemics, genetics.
- Economics: nonlinear market models, business cycles.
- Meteorology: weather prediction (infinite-dimensional chaotic atmosphere).
- Physics: turbulence, quantum chaotic systems, neural networks.
- Engineering: nonlinear system control, electronic oscillators.
- Cryptography: pseudo-random number generators based on chaotic maps.
History of the logistic map
The equation underlying the logistic map goes back to the Belgian mathematician Pierre François Verhulst, who introduced it in 1838 as a model of population growth with limited resources, as an alternative to Malthus's unlimited exponential growth. For over a century it remained a simple demographic model. It was the biologist Robert May who revealed its surprising complexity in a famous 1976 paper in Nature, entitled "Simple mathematical models with very complicated dynamics", showing how an elementary equation could generate chaotic behaviour. In the same years Mitchell Feigenbaum discovered the universality of the bifurcations, that is that the same constant governs the transition to chaos across a whole class of systems. The logistic map thus became the most famous and didactic example of chaos theory.
The logistic map and deterministic chaos
The deepest lesson of the logistic map is the existence of deterministic chaos. The equation is completely deterministic: knowing the current value, the next is computed with absolute precision, without any randomness. Yet, for r beyond the Feigenbaum threshold, the long-term behaviour becomes unpredictable: two very close initial conditions diverge exponentially, the famous "butterfly effect". Determinism and predictability, which classical intuition regarded as equivalent, turn out to be distinct concepts. This discovery revolutionised 20th-century science, showing that simple systems can be intrinsically unpredictable not through ignorance of the laws, but through the amplification of errors. The logistic map is the minimal model that captures this deep idea, with applications from meteorology to ecology, from physics to economics.
Updated July 2026
Comments (0)
Login to leave a comment.
No comments yet. Be the first!