THE SCIENCE
How this simulation works
The logistic equation xₙ₊₁ = r xₙ(1−xₙ) is iterated. The background bifurcation map displays long-run populations for thousands of parameter/iteration combinations.
See how a simple recursion transitions from stability into chaos.
The logistic equation xₙ₊₁ = r xₙ(1−xₙ) is iterated. The background bifurcation map displays long-run populations for thousands of parameter/iteration combinations.
Drag r past 3.57 and compare stable versus chaotic states. Use Play, Pause and Reset to compare outcomes. All calculations run locally inside your browser.