Discrete Dynamical System

A Dynamical System[1], also known as a Map can be defined informally, and without the need to delve into more advanced regions of mathematics, as a way of describing the evolution of a state over fixed time intervals[2]. Such systems are discrete when we consider changes over integer intervals. They can be expressed using the general iterative formula: \begin{equation} x_{n+1} = f(x_n), \end{equation} where $f$ is a known continuous function and $n \in\mathbb{Z^+}$. Equation $(1)$ is a first order formula as the next value, $x_{n+1}$, depends only on the previous value, $x_{n}$. Equations of this kind can be used to describe the fluctuations of a population over a number of generations. A prime example of the biological applications of discrete dynamical systems is the Verhulst process...

The Verhulst Process

The Verhulst Process[3], developed by French mathematician Pierre-François Verhulst in the 19th century is used model bounded population growth. The formula describing this process can be written as: \begin{equation} \ x_{n+1} = x_n + rx_n(1-x_n), \end{equation} where $x_{n+1}$ is the population of the next generation, $r\in\mathbb{R}_{>0}$ is a fixed parameter, which determines how the population changes and $x_n$ is the current population. This map is one-dimensional as we are only interested in the evolution of a single quantity (the population $x_n$) which in order for it to make physical sense we need to restrict to $x_n \geq 0\ \forall n\in\mathbb{N}$. The parameter $r$ plays a very important role in the evolution of the population or, in more abstract terms, in the evolution of the process and we will examine the impact of the value of $r$ in the iterations, i.e. as $n$ increases.

$x_{n+1} = x_n + $$ x_n(1-x_n)$

Figure 1. A Cobweb plot of the Verhulst process with initial condition $x_0 = 0.1$. As you move the slider you change the value of the parameter $r$ in the equation for the Verhulst process.

The graph above, which is an example of a Cobweb plot, shows how varying the value of $r$ affects the values of $x_n$ as $n$ becomes big.In the graphs we have set the maximum number of iterations to be 1000, in order to be computationally efficient and because a greater number of iterations has a minuscule impact on the graph.

Cobweb Plot: A graph which shows the qualitative behaviour of one-dimensional discrete maps.[4]

As one can easily observe, in the range $0 < r < 2$ as $n$ increases the process converges to a single point but as $r$ becomes greater than 2, in fact as $r$ is in the range $2< r < 2.45$ we see that for big $n$ the process does not remain fixed at one point but it oscillates between two different points. This is an instance of a period-doubling which reoccurs when $r$ becomes greater than 2.45, after which the map oscillates between four points. As $r$ continues to grow, these period doublings get more and more frequent until we reach $r=2.57$, after which the number of points between which the graph oscillates becomes chaotic. The following graph shows a more complete numerical approach to the relation between the value of $r$ and not only the number of fixed points, but also their values.

Figure 2. Bifurcation plot (left) and it's relation with the fixed points (right). In the bifurcation plot you can move the slider to shift between values of $r$ and observe the results of the change in the Cobweb plot.

For an analytical approach to the relation between the value of $r$ and the number of points between which the graph oscillates we need to introduce a few definitions.

Fixed Point: A fixed point is a point $\mathbb{X}$ where $\mathbb{X}$ satisfies \begin{equation} \mathbb{X} = f(\mathbb{X}) \end{equation} for $f$ a discrete dynamical system.[5]

This point is fixed since $(3)$ implies that after $\mathbb{X}$ we have: \begin{equation} \ x_{n+1} = x_n \end{equation} So no matter how many times we iterate after the point $\mathbb{X}$ has been reached the population will remain constant. In the Verhulst process a fixed point could be found by solving: \begin{equation} \ \mathbb{X} = \mathbb{X} + r\mathbb{X}(1-\mathbb{X}). \end{equation}

Stable Fixed Point: A fixed point $\mathbb{X}$ is called stable if: \begin{equation} | \frac{d}{dx} f(\mathbb{X}) | < 1. \end{equation} If on the other hand: \begin{equation} | \frac{d}{dx} f(\mathbb{X}) | > 1, \end{equation} Then the point is called unstable.[6]

Solving equation $(5)$ we can easily determine that the fixed points for the Verhulst process are $\mathbb{X} = 0$ or $\mathbb{X} = 1$. We can also easily determine $\frac{d}{dx} f(x)$ for the Verhulst process: \begin{equation} \frac{d}{dx} f(x) = 1 + r(1-2x). \end{equation} Now substituting for the two fixed values of $\mathbb{X}$ that we found we get that for $\mathbb{X} = 0$ \begin{equation} | \frac{d}{dx} f(x) | = |1 + r| \end{equation} and for $\mathbb{X} = 1$: \begin{equation} | \frac{d}{dx} f(x) | = |1 - r|. \end{equation} It is clear that for $0 < r < 2$ we have $\mathbb{X} = 0$ is unstable, since $|1 + r|>1$ for $r>0$, however $\mathbb{X} = 1$ is stable since $|1 - r|< 1$ for $r< 2$. But at $r=2$ we can see that both points are unstable. But as we can see from the numerical approach the value of $x_n$ for big $n$ oscillates between two values, so we need to consider more than just the previous iteration. This means that we must have that: \begin{equation} x_{n+2} = f(x_{n+1}) = f(f(x_n)) \end{equation} i.e. \begin{equation} \begin{aligned} x_{n+2} & = [x_n + rx_n(1-x_n)] + r[x_n + rx_n(1-x_n)][1-x_n - rx_n(1-x_n)]\\ & = x_n+2rx_n+r^2x_n-2rx_n^2-3r^2x_n^2-r^3x_n^2+2r^2x_n^3+2r^3x_n^3-r^3x_n^4 \end{aligned} \end{equation} In order to find the fixed points for $(12)$ we would need to solve: \begin{equation} \mathbb{X} = \mathbb{X}+2r\mathbb{X}+r^2\mathbb{X}-2r\mathbb{X}^2-3r^2\mathbb{X}^2-r^3\mathbb{X}^2+2r^2\mathbb{X}^3+2r^3\mathbb{X}^3-r^3\mathbb{X}^4, \end{equation} this an equation of 4th degree, which is normally fairly complicated to solve; however, since the fixed points we had already determined remain fixed points, we already know two of the solutions. This is easy to see by $(3)$ and $(11)$ as, for $\mathbb{X}$ fixed we have: \begin{equation} f(f(\mathbb{X})) = f(\mathbb{X}) =\mathbb{X} \end{equation} Now if we go back to $(13)$ we can factor out $\mathbb{X}(\mathbb{X}-1)$ to get: \begin{equation} \mathbb{X}(\mathbb{X}-1)(-r^3\mathbb{X}^2+\mathbb{X}(r^3+2r^2)-r^2-2r)=0 \end{equation} Solving the quadratic factor gives us: \begin{equation} \begin{aligned} \mathbb{X}_1 &= \frac{r +2 +\sqrt{r^2-4}}{2r} \text{, and} \\ \mathbb{X}_2 &= \frac{r +2 -\sqrt{r^2-4}}{2r} \end{aligned} \end{equation} If we look at the derivatives of the two new fixed values $\mathbb{X}_1$ and $\mathbb{X}_2$, keeping in mind that the fact that this is a 2-cycle, i.e. the function oscillates between the two values implies the symmetric relation between : \begin{equation} \begin{aligned} f(\mathbb{X}_1)&= \mathbb{X}_2 \text{, and}\\ f(\mathbb{X}_2)&= \mathbb{X}_1; \end{aligned} \end{equation} we get that: \begin{equation} \begin{aligned} | \frac{d}{dx}f(f(\mathbb{X}))|_{\mathbb{X}_1,\mathbb{X}_2} & = |f'(\mathbb{X})f'(f(\mathbb{X}))|_{\mathbb{X}_1,\mathbb{X}_2} \\ & = |f'(\mathbb{X}_1)f'(\mathbb{X}_2)| \\ & = |5 - r^2|. \end{aligned} \end{equation} We can then determine that within a specific range of $r$ they are both stable by simply solving: \begin{equation} \begin{aligned} |5 - r^2|< 1 . \end{aligned} \end{equation}

This gives us that the two points $\mathbb{X}_1 = \frac{r +2 +\sqrt{r^2-4}}{2r} $ and $\mathbb{X}_2 = \frac{r +2 -\sqrt{r^2-4}}{2r}$ are stable for $2< r <\sqrt{6}$, but at $r = \sqrt{6}$ these two points become unstable, so all four points are now unstable. This would indicate another period doubling which we would deal by using similar methods to solve: \begin{equation} x_{n+4} = f(x_{n+2}) = f(f(f(f(x_n))))=f^{(4)}(x_n) \end{equation} This time, when trying to find the solutions for the fixed values we would end up with an equation of 16th degree of which we only know four solutions this level of mathematics is too intricate for the scope of this investigation.

Road to Chaos...

If we wish to delve deeper into the theory of discrete dynamical systems we will se that the limit of the ratio of consecutive intervals between which a period-doubling occurs gives us the first Feigenbaum Constant[5]. This process of recurring period-doubling is also known as bifurcation and continues in a similar manner until $r$ reaches the value 2.57, after which the map displays chaotic behaviour. This means that the period-doubling after this point occurs in such a way that the system is able to end up in any value. This can be seen in the second graph, where if we set $r$ to be greater than 2.57 we see that the system, which follows the very simple rule of equation $(2)$ appears to have a random behaviour. This behaviour is all but random, though; it is chaotic.

Chaos: Aperiodic, time-asymptotic behaviour in a deterministic system which exhibits sensitive dependencies on initial conditions.[7]

As we can see one of the main properties of chaotic behaviour, and one which we have not examined so far is the initial value sensitivity. Up to now we have kept the initial value of the process fixed to $x_0=0.1$ but we can easily see for $r>2.57$; the long term oscillations of the fixed points change drastically with insignificant changes to the initial condition. Try it:

Initial Values:

R value:

Figure 3. Initial value sensitivity of the Verhulst process. This graph is a bit more involved than the previous ones. Using the upper slider you can select two different inital values for the process, by moving either end of the slider. The bottom slider is used to change the value of $r$.

As Edward Norton Lorenz, the American mathematician who discovered deterministic chaos, said:
The present determines the future, but the approximate present does not approximately determine the future.[8]
One final thing that can be observed about the map is that it displays a property called self-similarity.

Self-similarity: The preperty that a geometrical figure has when each portion of the image can be considered a reduced-scale image of the entire figure.[9]

Self-similarity is at the core of the definition of a fractal, in the form of scale invariance. This can be seen in the graph by zooming in at points of the map after the parameter $r$ has caused the behaviour to become chaotic we can see that the graph appears to be the same as the larger scale of itself.

Figure 4. Bifurcation plot (left) and it's relation with the fixed points (right). Through this graph you can see the fractal properties of the bifucation plot. In general the graph is similar to the one one in Figure 2, with the main difference that now you can select and isolate a region of the bifurcation plot and zoom into it to observe the self similarity. Isolating a region in the left part of the plot automatically selects the corresponding region in the right graph.
Find out more about chaos...

References

  1. Wikipedia. Dynamical system - Wikipedia, The Free Encyclopedia; 2016. [Online; accessed 14-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Dynamical_system&oldid=704769798.
  2. Weisstein E. Dynamical System.;. [Online; accessed 13-March- 2016]. From MathWorld - A Wolfram Web Resource. Available from: http://mathworld.wolfram.com/DynamicalSystem.html.
  3. Berkshire F. Lecture notes in M1J1. Imperial College London; 2016.
  4. Rechnitzer A. 'Graphical Analysis'. University of British Columbia: Department of Mathematics. Web Resource.; 2003. [Online; accessed 13-March-2016]. Available from: https://www.math.ubc.ca/~andrewr/620341/pdfs/ga_sum.pdf.
  5. Kibble T, Berkshire F. Classical Mechanics, 5th edition (greek version). London, UK: Imperial College Press; 2004. p. 360-376.
  6. Lynch S. Dynamical Systems With Applications Using Mathematica. Boston, MA: Birkhauser; 2007. Chapter 12.
  7. Fitzpatrick R. 'The Definition Of Chaos'. Personal Page of Richard Fitzpatrick, at The University of Texas at Austin. Web Re- source.; 2006. [Online; accessed 13-March-2016]. Available from: http://farside.ph.utexas.edu/teaching/329/lectures/node57.
  8. Boeing G. 'Chaos Theory And The Logistic Map'. Web Resource.; 2015. [Online; accessed 13-March-2016]. Available from: http://geoffboeing.com/2015/03/chaos-theory-logistic-map/.
  9. Mandelbrot B. How Long Is the Coast of Britain? Statistical Self- Similarity and Fractional Dimension. Science, New Series. May 5, 1967;156(3775):636-638.