Logistic map
Named by 15 essays across one field — each of them below, with the objects they name alongside it.
The staircase that shows the whole orbit
Take a number, feed it to a rule, feed the answer back in. There is a way of drawing that on the rule's own graph which turns the entire future of a starting point into a shape — and the shape is legible.
A point that pulls, and a point that pushes
Every crossing of a curve with the diagonal is a value the rule leaves alone. Whether anything ever arrives there is decided by one number — the slope at the crossing — and the picture makes the reason obvious.
The road paved with doublings
Turn one dial slowly and watch what a map settles into. It settles on a point, then on two points, then four, then eight — faster and faster, and the doublings run out at a parameter that is finite.
A constant that does not care which map
The gaps between successive period doublings shrink by a factor. Measure that factor for the logistic map and you get 4.669. Measure it for a completely different map and you get 4.669, and nobody expected that.
A difference too small to draw
Two starting points a ten-thousandth apart, under the same rule, with nothing random anywhere. Within forty steps they have nothing in common — and the rule was not doing anything to them that it does not do to everything.
How fast two orbits part
The word "sensitive" is an adjective. Averaging the logarithm of one derivative along an orbit turns it into a number — one that says how many steps of prediction the map allows, and whose sign says whether it allows any.
The same map in different coordinates
The tent map and the logistic map at four look nothing alike and are the same map, carried onto each other by a change of variable. Everything either one does the other does, and the change of variable is a sine squared.
The folds that measure chaos
Apply the logistic map six times and its graph goes up and down 38 times at r = 3.5 and 64 times at r = 4. How fast that number of folds multiplies with each further step is the map's topological entropy: zero through the whole cascade of period doublings, log of the golden ratio in the window of three, log 2 at the top — and it never decreases as r rises.
The dark lines are one point's orbit
Past the end of the period-doubling cascade the bifurcation diagram turns into grey bands crossed by darker curves. Every one of those curves is the orbit of a single point — the top of the hump — and the places where they meet are exactly where the bands merge, in a second cascade that runs backwards at the same rate.
The window that opens with a stutter
The period-three window does not fade in. At r = 1 + √8 a cycle of three appears out of nothing, and just before it does, the chaotic orbit keeps imitating the cycle that is not there yet — for twenty steps, then fifty, then hundreds, in quiet stretches whose length grows as one over the square root of the distance to the window.
A solvable chaos of every degree
The logistic map at four is chaotic and, through a change of coordinates, completely solvable: its orbits are cosines of doubling angles. The trick is not a one-off. For every whole number n there is a polynomial of degree n that multiplies angles by n instead of 2, and every one of them is exactly as solvable, has exactly nᵏ points of period k, and preserves the same distribution — and any two of them commute, which almost no two polynomials do.
![A strand of the logistic map's diagram between r = 3.8284 and 3.8572, upside down. The bifurcation diagram of the logistic map cropped to r in [3.8284, 3.8572] and x in [0.44, 0.565], with the value axis inverted.](/f/a-strand-of-the-logistic-map-s-diagram-between-r-3-8284-36b84e6c.svg)
Every window is the whole diagram again
Zoom into one strand of the period-three window of the logistic map and the whole bifurcation diagram is there again — a single value, a fork, a cascade of doublings, chaos, bands and windows — upside down and ninety-seven times narrower. The doublings inside it shrink by Feigenbaum's 4.669, exactly as the originals do, because near the top of its hump the map's third iterate is itself a one-humped map, turned over.
Windows counted like necklaces
The logistic map has one window of period three, two of period four, three of period five, five of period six, nine of period seven — and the sine map, which shares no algebra with it, has exactly the same numbers, in exactly the same order along the parameter. The counts are 1, 1, 1, 2, 3, 5, 9, 16, 28, 51, and they are the number of ways to thread a necklace of beads in two colours.
Two chaotic orbits made to agree
Chaos means two copies of a system started a hair apart soon have nothing in common. Couple them — let each take a fraction ε of its next step from the other — and above a definite strength they agree to every digit for ever, while each stays exactly as chaotic as before. The strength needed is read off the same number that measured the chaos: the Lyapunov exponent.
The entropy in a single orbit
Topological entropy measures how fast all the orbits of a map come apart, which sounds like a property of every orbit at once. For a map with one fold it is decided by just one: the orbit of the turning point. Read that orbit as a string of signs, make a power series of it, and the entropy is minus the logarithm of the series' first zero — ln 2 at the top of the logistic family, ln φ in the window of three, and nought where the signs become the Thue–Morse sequence.
Named alongside it
The objects these essays reach for when they reach for this one.
ChaosPeriodic orbitBifurcationPeriod-doublingIterationLyapunov exponentOrbitSelf-similarityAttractorFixed pointScalingSensitive dependence