The logistic difference equation and the route to chaotic behaviour

Similar documents
Stability and complexity in model ecosystems

2 Discrete growth models, logistic map (Murray, Chapter 2)

Behaviour of simple population models under ecological processes

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325

Discrete versus continuous-time models of malaria infections

Co-existence of Regular and Chaotic Motions in the Gaussian Map

6.094 Introduction to MATLAB January (IAP) 2009

Lecture 3. Dynamical Systems in Continuous Time

2 One-dimensional models in discrete time

16 Period doubling route to chaos

Edward Lorenz. Professor of Meteorology at the Massachusetts Institute of Technology

Discrete Time Coupled Logistic Equations with Symmetric Dispersal

The effect of emigration and immigration on the dynamics of a discrete-generation population

Dynamical Systems: Lecture 1 Naima Hammoud

Lecture 1: A Preliminary to Nonlinear Dynamics and Chaos

Maps and differential equations

Discrete time dynamical systems (Review of rst part of Math 361, Winter 2001)

Introduction to Dynamical Systems Basic Concepts of Dynamics

Nonlinear Dynamics. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna.

Deterministic Chaos Lab

More Details Fixed point of mapping is point that maps into itself, i.e., x n+1 = x n.

... it may happen that small differences in the initial conditions produce very great ones in the final phenomena. Henri Poincaré

Student Background Readings for Bug Dynamics: The Logistic Map

Chaotic motion. Phys 750 Lecture 9

Een vlinder in de wiskunde: over chaos en structuur

THREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations

Population Dynamics II

Homework 2 Modeling complex systems, Stability analysis, Discrete-time dynamical systems, Deterministic chaos

Logistic Model with Harvesting

Math 345 Intro to Math Biology Lecture 7: Models of System of Nonlinear Difference Equations

Recursive Sequences in the Life Sciences

v n+1 = v T + (v 0 - v T )exp(-[n +1]/ N )

UNI 101z November 9, 2004 Population Dynamics and Chaos: A Descriptive Introduction Thomas Caraco Department of Biological Sciences 1.

Math 2930 Worksheet Introduction to Differential Equations. What is a Differential Equation and what are Solutions?

Chaotic motion. Phys 420/580 Lecture 10

The upper limit for the exponent of Taylor s power law is a consequence of deterministic population growth

CHAPTER 3 CHAOTIC MAPS BASED PSEUDO RANDOM NUMBER GENERATORS

Chaos. Dr. Dylan McNamara people.uncw.edu/mcnamarad

Example Chaotic Maps (that you can analyze)

The Big, Big Picture (Bifurcations II)

Introduction to Nonlinear Dynamics and Chaos

CHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS

SPATIOTEMPORAL CHAOS IN COUPLED MAP LATTICE. Itishree Priyadarshini. Prof. Biplab Ganguli

Dynamical Systems and Chaos Part II: Biology Applications. Lecture 6: Population dynamics. Ilya Potapov Mathematics Department, TUT Room TD325

MATH 215/255 Solutions to Additional Practice Problems April dy dt

5.3 METABOLIC NETWORKS 193. P (x i P a (x i )) (5.30) i=1

Chapitre 4. Transition to chaos. 4.1 One-dimensional maps

Lab 5: Nonlinear Systems

Use separation of variables to solve the following differential equations with given initial conditions. y 1 1 y ). y(y 1) = 1

Dynamics and Chaos. Copyright by Melanie Mitchell

Chaos, Complexity, and Inference (36-462)

Chapter 4. Transition towards chaos. 4.1 One-dimensional maps

Oscillatory Motion. Simple pendulum: linear Hooke s Law restoring force for small angular deviations. small angle approximation. Oscillatory solution

The Phase-Modulated Logistic Map: an Exploration

Oscillatory Motion. Simple pendulum: linear Hooke s Law restoring force for small angular deviations. Oscillatory solution

Logistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations

Computational Methods for Nonlinear Systems

Population Dynamics. Max Flöttmann and Jannis Uhlendorf. June 12, Max Flöttmann and Jannis Uhlendorf () Population Dynamics June 12, / 54

arxiv: v1 [math.st] 4 Apr 2011

First-order transient

Lecture 6. Lorenz equations and Malkus' waterwheel Some properties of the Lorenz Eq.'s Lorenz Map Towards definitions of:

Modelling biological oscillations

Unit Ten Summary Introduction to Dynamical Systems and Chaos

Qualitative Analysis of Tumor-Immune ODE System

CDS 101/110a: Lecture 2.1 Dynamic Behavior

Chaos and Liapunov exponents

COSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics

Are numerical studies of long term dynamics conclusive: the case of the Hénon map

6.2 Brief review of fundamental concepts about chaotic systems

Lecture 3 : Bifurcation Analysis

Nonlinear Dynamics and Chaos Summer 2011

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for COMPUTATIONAL BIOLOGY A. COURSE CODES: FFR 110, FIM740GU, PhD

Math 2930 Worksheet Introduction to Differential Equations

MA 777: Topics in Mathematical Biology

Computational Methods for Nonlinear Systems

MAT 17A - UHP - DISCUSSION #10 December 1, 2015

Homework Exercises for Chapter 10 TL Bar Elements: Truss Analysis

A New Science : Chaos

CHAOS -SOME BASIC CONCEPTS

Fractals, Dynamical Systems and Chaos. MATH225 - Field 2008

Scale-free extinction dynamics in spatially structured host parasitoid systems

Lesson 4: Non-fading Memory Nonlinearities

Majid Sodagar, 1 Patrick Chang, 1 Edward Coyler, 1 and John Parke 1 School of Physics, Georgia Institute of Technology, Atlanta, Georgia 30332, USA

Asynchronous and Synchronous Dispersals in Spatially Discrete Population Models

Complex system approach to geospace and climate studies. Tatjana Živković

INTRODUCTION TO CHAOS THEORY T.R.RAMAMOHAN C-MMACS BANGALORE

Dynamical Systems. Dennis Pixton

Chapter 1, Section 1.2, Example 9 (page 13) and Exercise 29 (page 15). Use the Uniqueness Tool. Select the option ẋ = x

From Determinism to Stochasticity

arxiv: v1 [nlin.cd] 22 Feb 2011

Lecture 7. Order Out of Chaos

Global theory of one-frequency Schrödinger operators

Revista Economica 65:6 (2013)

MAS212 Assignment #2: The damped driven pendulum

Theoretical physics. Deterministic chaos in classical physics. Martin Scholtz

Ordinary Differential Equations

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

CDS 101/110a: Lecture 2.1 Dynamic Behavior

xt+1 = 1 ax 2 t + y t y t+1 = bx t (1)

Reconstruction Deconstruction:

Transcription:

The logistic difference equation and the route to chaotic behaviour Level 1 module in Modelling course in population and evolutionary biology (701-1418-00) Module author: Sebastian Bonhoeffer Course director: Sebastian Bonhoeffer Theoretical Biology Institute of Integrative Biology ETH Zürich 1 Introduction 1.1 Difference equations versus differential equations Frequently population dynamical models assume continuous time. Models in continuous time are usually appropriate for organisms that have overlapping generations. However, many biological populations are more accurately described by non-overlapping generations (such as insect populations with one generation per year or annual plants). The dynamics of these populations are often more appropriately expressed by so-called difference equations. Here, the population size of the next generation t + 1 is expressed as a function of the population size in the current generation t. In general a single species difference equation can be expressed as n t+1 = C(n t )n t In analogy to the exponential equation the simplest difference equation is obtained if C(n t ) is a constant: n t+1 = Rn t (1) 1

It is easy to see (by iteration of the above equation) that the solution is given by n t = n 0 R t (2) where n 0 is the population size in generation t = 0. exponential function in discrete time. This equation is the analogue of the In R, such a single species difference equation can be coded as model <- function(r,n0,time) { output <- numeric(time+1) output[1] <- n <- n0 for (t in c(1:time)) { n <- r * n output[t+1] <- n } output } ### Run the model out <- model(1.2,1,10) ### Plot the model plot(1:length(out)-1,out,xlab="time",ylab="population size") 1.2 Logistic difference equation The logistic difference equation is given by x t+1 = x t e r(1 xt) (3) It can be derived as a discrete time analogy to the logistic differential equation, which is given by dx = rx(1 x) (4) dt where x is the population density (scaled by its carrying capacity) and r is the maximal growth rate of the population at low values of x. For more information on the logistic difference equation and its relation to the logistic differential equation, please, see the lecture script Ecology and Evolution II: Populations by Sebastian Bonhoeffer. Another equation that is often referred to as the logistic difference equation or logistic map is given by x t+1 = rx t (1 x t ), where 1 r 4 and 0 x 1. This equation displays analogous dynamical behaviour as Eq. 3. 2

x 5 r Figure 1: The bifurcation diagram of the logistic difference equation for 0 < r < 4. 1.3 Implementing the logistic difference equation Modify the supplied R script to implement the logistic difference equation. Run it from any initial value between 0 and 1 until t = 30, with three different values of r: 1.5, 2.2 and 3.5. Plot the obtained time series. What sort of behaviour do you observe for the different values of r? Experiment with other values for r, different initial conditions and different series lengths. 1.4 The route to chaos as illustrated by the bifurcation diagram Figure 1 shows a bifurcation diagram. This plot is obtained in the following way. For each value of r, the logistic difference equation is iterated for n steps (starting from a random initial 3

number) to attain stable behaviour (if there is any). Then a further m iteration steps are performed and x t is plotted at the resulting time points n < t < n + m. Figure 1 was generated with n = 1000 and m = 300. For r < 2 the dynamics are similar to that of the logistic differential equation in that the population always converges to the steady state x t = 1 for large t (which implies that the population n t is always at its carrying capacity K). At r = 2 there is the first bifurcation (period doubling) as the solution begins to oscillate between two values for this value of r. As r increases further there are further period doublings, resulting in cycles of period 4, 8, 16, and so on. Eventually, for even larger values of r the logistic differential equation shows chaotic behaviour, which means that the population behaviour cannot be predicted accurately for longer periods of time. Two trajectories starting from nearly identical values will diverge further and further away from each other. 1.5 Phase diagrams and stable cycles Another way to explore the dynamical behaviour of the logistic difference equation are phase diagrams in which the value of x t+k is plotted against x t for a given time series and a given choice of k. Figure 2 shows the phase diagrams for several values of k. If (after a transient phase of equilibration) x t+k = x t for all values of t, then the system shows stable cycles with period k. (The bifurcation diagram in Figure 1 indicates that there are parameter values of r for which the system shows stable cycles.) If for a given value of r the system converges to a stable cycle with period k, then the trajectory should converge to a point in the phase diagram plotting x t+k against x t. 1.6 General message The important message is that simple models can show complex behaviour. Hence, if we observe a complex dynamic behaviour of a natural population in the field, this does not necessarily imply that the underlying rules determining the dynamics have to be complex too. Moreover, the complex behaviour of the logistic difference equation is in strong contrast with the comparatively simple behaviour of the logistic differential equation. As a rule of thumb difference equations show more complicated behaviour than the corresponding models in continuous time a. a The discovery of the role of deterministic chaos in biology largely goes back to Robert May. Being a native of Australia, Robert May was first a theoretical physicist. Becoming the successor to Robert McArthur as a theoretical ecologist at Princeton University, Robert May moved on later to Oxford University. As one of very few scientist Robert May was made a Lord by the British Queen in 2001. Robert May has also received an honorary doctorate from the ETH Zurich. 4

k=1 k=2 x[1] x[2] k=3 k=4 x[3] x[4] Figure 2: Phase diagrams plotting x t+k against x t for k = 1, 2, 3 and 4. The black solid line shows for a given k the values x t+k for 0 x t 4. The dashed line represents the diagonal. Hence the intersection of the dashed line and the solid line gives the points where x t+k = x t, indicating that at these points the system shows periodicity with period k. However, this periodic behaviour can be stable or unstable. The red line represents the trajectory (time course) of the system in the phase plane. (The red line connects the points (x 0, x 0 ), (x 0, x k ), (x k, x k ), (x k, x 2k ),..., (x i k, x i k ), (x i k, x (i+1) k ) etc. A stable cycle of period k is manifest as a convergence of the redline to a point in the phase diagram of (x t, x t+k ). In the plots shown here r = 2.6 and the panel with k = 4 shows that we have a stable cycle with period 4 for this value of r. 5

2 Exercises 2.1 Basic exercises Eb1. Generate bifurcation plots as in Figure 1. Amplify interesting sections of the plot by constraining the range of r and using smaller increments. Generate time series plots for interesting values of r. Eb2. Generate chaotic time series (e.g. take r = 3.5) and look at the distribution of x values attained in the series. Is it completely random (i.e. uniformly distributed)? Hint: use the hist() function to visualize the distribution. You can use long time series and high resolution histograms for best effect. Eb3. Are there windows of periodic behaviour within chaotic regimes? Try to develop a method that computes the periodicity of a time series. (A periodicity of k means that x t+k = x k for all t that are sufficiently large such that the dynamic behaviour has stabilized). Are there parameter values of r for which the LDE shows dynamic behaviour with uneven periodicity? Advanced option: plot periodicity as a function of r. 2.2 Advanced/additional exercises Ea1. Plot the dynamic behaviour of the LDE in a phase diagram (see section 1.5 and Figure 2). When are periodic solutions stable? What are the graphical conditions for stability? (Hint: look at the slopes of the intersecting lines.) Ea2. How can one define chaotic behaviour? What characterizes chaotic versus non-chaotic regimes? Try to develop a quantitative measure that allows you to distinguish between both regimes, and approximate the critical value of r at which chaotic behaviour appears. Ea3. Start two simulation runs from slightly different population sizes. Check whether the two trajectories are diverging from each other, or converging into a single trajectory. Do this for different regimes of the growth rate (stable, periodic, chaotic behaviour). Ea4. Develop a spatial extension of the LDE (along the lines of the spatial Nicholson-Bailey model, see corresponding module). Assume that a certain fraction of individuals migrates to neighbouring fields. How does space affect chaotic dynamics? Note that this may be a work-intensive (but fun) extension to the LDE! 6