58 Chaotic Modelling and Simulation
3.2 The Bifurcation Diagram
The period doubling and other properties of the logistic map are presented in the
so-called bifurcation diagram. This is a two-dimensional graph (b, x
t
) formed as
follows: For each value of the chaotic parameter b, the values of x
t
that form the
stable orbit are plotted. Figure 3.15(a) shows how the bifurcation diagram looks for
b < 3.5. For 0 < b < 1, there is only one fixed point, at x = 0. For 1 < b < 3, the
fixed point is x = 1 −
1
b
. At b = 3, this splits up into the order-two orbit, which at
3.449 becomes unstable and splits up into an order-4 orbit and so on. The greyed out
lines show the values that these orbits would have had if they were still stable.
The full bifurcation diagram for the logistic map appears in Figure 3.15(b). The
first bifurcation point is located at
b = 3, x = 1 −
1
b
, and the next two at b ≈ 3.4495,
the next four at b ≈ 3.54409 and so on, according to the theory. These points can
be calculated by solving the appropriate equation of the form f
n
(x) = x, though this
becomes exceedingly difficult as n increases. The construction of the bifurcation
diagram typically follows these steps:
1. Break the range of b ([0, 4]) into small intervals.
2. For each interval, choose a b in that interval (say the left end-point), and per-
form repeated applications of the iterative process x
n+1
= f (x
n
) until stability
is achieved. At this point, the desired values x
n
will be determined.
3. Move on to the next value of b. Use the previously found stable x values as
starting points for the iteration process, to achieve stability much quicker.
The characteristic values of the parameter b at each bifurcation stage follow the
Feigenbaum law. According to this law the sequence of period doubling, presented
in the above figure by a bifurcation tree, is due to a quantitative convergence of the
parameter b, which tends to a universal parameter δ = 4.6692016 ···. This parameter
is given by the expression
δ = lim
i→∞
b
i−1
− b
i
b
i
− b
i+1
The behaviour of the system can be understood better by considering a scaled
version. More generally, if we consider a system
x
n+1
= f (x
n
)
then we consider the function:
g(x) = lim
n→∞
1
f
2
n
(0)
f
2
n
x f
2
n
(0)
Then, under some mild conditions on the map f , g satisfies the universal equation:
g(αx) = −αg
g
(
−x
)
(3.8)