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

Similar documents
Chaos & Recursive. Ehsan Tahami. (Properties, Dynamics, and Applications ) PHD student of biomedical engineering

2 One-dimensional models in discrete time

One Dimensional Dynamical Systems

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

Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II.

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

A simple genetic model with non-equilibrium dynamics

Lecture 3. Dynamical Systems in Continuous Time

Asynchronous and Synchronous Dispersals in Spatially Discrete Population Models

Bifurcation of Fixed Points

B5.6 Nonlinear Systems

By Nadha CHAOS THEORY

Clearly the passage of an eigenvalue through to the positive real half plane leads to a qualitative change in the phase portrait, i.e.

Problems for 3505 (2011)

8.1 Bifurcations of Equilibria

TWO DIMENSIONAL FLOWS. Lecture 5: Limit Cycles and Bifurcations

Microevolution Changing Allele Frequencies

Stability of Dynamical systems

Chapter 17: Population Genetics and Speciation

Fundamentals of Dynamical Systems / Discrete-Time Models. Dr. Dylan McNamara people.uncw.edu/ mcnamarad

B5.6 Nonlinear Systems

The genome encodes biology as patterns or motifs. We search the genome for biologically important patterns.

Population is often recorded in a form of data set. Population of Normal, Illinois

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

Mathematical modelling of Population Genetics: Daniel Bichener

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

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

Example Chaotic Maps (that you can analyze)

16 Period doubling route to chaos

Problem set 7 Math 207A, Fall 2011 Solutions

Processes of Evolution

D. Incorrect! That is what a phylogenetic tree intends to depict.

EE222 - Spring 16 - Lecture 2 Notes 1

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

MATH 415, WEEKS 14 & 15: 1 Recurrence Relations / Difference Equations

The Wright-Fisher Model and Genetic Drift

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

EVOLUTION UNIT. 3. Unlike his predecessors, Darwin proposed a mechanism by which evolution could occur called.

Outline of lectures 3-6

Nonlinear dynamics & chaos BECS

Lecture 1: A Preliminary to Nonlinear Dynamics and Chaos

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

Segregation versus mitotic recombination APPENDIX

Model Building: Selected Case Studies

The Sine Map. Jory Griffin. May 1, 2013

Lecture 5. Outline: Limit Cycles. Definition and examples How to rule out limit cycles. Poincare-Bendixson theorem Hopf bifurcations Poincare maps

Introduction to Natural Selection. Ryan Hernandez Tim O Connor

Math 312 Lecture Notes Linearization

(Write your name on every page. One point will be deducted for every page without your name!)

The theory of evolution continues to be refined as scientists learn new information.

Math 345 Intro to Math Biology Lecture 1: Biological Models using Difference Equations

Introduction to Dynamical Systems Basic Concepts of Dynamics

MATH 1700 FINAL SPRING MOON

Q2 (4.6) Put the following in order from biggest to smallest: Gene DNA Cell Chromosome Nucleus. Q8 (Biology) (4.6)

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

PHY411 Lecture notes Part 4

2 Discrete-Time Markov Chains

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

Lagrange Multipliers

In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.

Outline of lectures 3-6

The Genetics of Natural Selection

Genetics and Natural Selection

August 16, Alice in Stretch & SqueezeLand: 15 Knife Map. Chapter Summary-01. Overview-01. Overview-02. Rossler-01. Rossler-02.

Models Involving Interactions between Predator and Prey Populations

= F ( x; µ) (1) where x is a 2-dimensional vector, µ is a parameter, and F :

5/31/2012. Speciation and macroevolution - Chapter

The Mechanisms of Evolution

Chaos. Lendert Gelens. KU Leuven - Vrije Universiteit Brussel Nonlinear dynamics course - VUB

Heredity and Genetics WKSH

Lesson 4: Understanding Genetics

Computational Aspects of Aggregation in Biological Systems

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

APPPHYS217 Tuesday 25 May 2010

Mathematical Models in Biology. Christina Kuttler

Solutions for B8b (Nonlinear Systems) Fake Past Exam (TT 10)

Student Background Readings for Bug Dynamics: The Logistic Map

Chapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems

Agenda Sections 2.4, 2.5

MATH 614 Dynamical Systems and Chaos Lecture 2: Periodic points. Hyperbolicity.

Department of Mathematics IIT Guwahati

Mechanisms of Evolution

Enduring Understanding: Change in the genetic makeup of a population over time is evolution Pearson Education, Inc.

Local Stability Analysis of a Mathematical Model of the Interaction of Two Populations of Differential Equations (Host-Parasitoid)

Solutions to homework assignment #7 Math 119B UC Davis, Spring for 1 r 4. Furthermore, the derivative of the logistic map is. L r(x) = r(1 2x).

Dynamics of a plant-herbivore model

8. Genetic Diversity

STABILITY. Phase portraits and local stability

EXCELLING WITH BIOLOGICAL MODELS FROM THE CLASSROOM T0 RESEARCH

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

AP Biology Evolution Review Slides

SEMELPAROUS PERIODICAL INSECTS

Nonlinear Dynamics and Chaos Summer 2011

Why are Discrete Maps Sufficient?

BIOS 6150: Ecology Dr. Stephen Malcolm, Department of Biological Sciences

ONE DIMENSIONAL FLOWS. Lecture 3: Bifurcations

Math 308 Final Exam Practice Problems

Section 1.1 Algorithms. Key terms: Algorithm definition. Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error

Chaos and Liapunov exponents

How to Use This Presentation

Transcription:

Math 345 Intro to Math Biology Lecture 7: Models of System of Nonlinear Difference Equations Junping Shi College of William and Mary, USA

Equilibrium Model: x n+1 = f (x n ), here f is a nonlinear function Equilibrium: (fixed point, constant solution) If x satisfies x = f (x), then x is an equilibrium of the difference equation x n+1 = f (x n ) An equilibrium is where the graphs of y = x and y = f (x) intersect Stability of an equilibrium: Suppose that x is an equilibrium of x n+1 = f (x n ) If we start the iteration sequence from any initial point x 0 close to x, we always have lim n x n = x, then x is stable; otherwise it is unstable Linearization: f (x) f (x ) + f (x )(x x ) (linear approximation, first order Taylor expansion) (IF x is close to x ) So near an equilibrium x, x n+1 = f (x n) f (x ) + f (x )(x n x ) = x + f (x )(x n x ) or x n+1 x f (x )(x n x ) (A linear equation!) Let y n = x n x Then y n+1 = f (x )y n If f (x ) > 1, then exponential growth (unstable) If 0 < f (x ) < 1, then exponential decay (stable) If 1 < f (x ) < 0, then exponential decaying oscillation (stable) If f (x ) < 1, then exponential growing oscillation (unstable)

Stability of Equilibrium Condition for stability: Suppose that x is an equilibrium of x n+1 = f (x n) Then x is a stable equilibrium if and only if f (x ) < 1 or 1 < f (x ) < 1, and it is unstable if f (x ) > 1 Bifurcation: a qualitative change in the mathematical system, and it can be reflected from the asymptotic behavior of solutions 1 Number of equilibrium changes 2 Stability of equilibria changes (so f (x ) = 1 at a bifurcation point) Bifurcation diagram of x n+1 = f (x n, λ): the curve of equilibria in (λ, x) space Use solid curve for stable equilibria, and dotted curve for unstable equilibria Periodic solution: If for some integer p, x n+p = x n for all n, then {x n } is a periodic solution with period p (or p-cycle) for x n+1 = f (x n ) with period p (If p = 1, then it is equilibrium) Period two solution (2-cycle): x 1 x 2 = f (x 1 )( x 1 ) x 3 = f (x 2 ) = f (f (x 1 )) = x 1 so x 1 is an equilibrium of the map f (f (x))!

Bifurcations Equilibrium bifurcation: occurs when f (x ) = 1 1 Transcritical bifurcation: 2 equilibria before and after bifurcation point, 1 equilibrium at the bifurcation point (example: x n+1 = λxn, x = 0 at λ = 1) 1 + x n 2 Pitchfork bifurcation: 3 equilibria after bifurcation point, 1 equilibrium before or at the bifurcation point (example: x n+1 = λx n 1 + xn 2, x = 0 at λ = 1) 3 Saddle-node (or fold, or blue-sky) bifurcation: 0 equilibrium before bifurcation point, 1 equilibrium at the bifurcation point, and 2 equilibria after bifurcation point (example: x n+1 = 3x n xn 2 h, x = 1 at λ = 1) Flip (Period-doubling) bifurcation: f (x ) = 1 but [f (f (x ))] = 1 so that the equilibrium x becomes an unstable one, and a stable period-two solution (2-cycle) emerges from the bifurcation) before bifurcation: stable pattern is a period-one equilibrium, after bifurcation: a stable pattern is period-two solution (Example: x n+1 = λx n 1 + xn b, b > 2, x = (λ 1) 1/b at λ = b b 2 )

Chaos For a non-monotone function f (x), the nonlinear model x n+1 = f (λ, x n ) can have chaotic dynamics A typical route to chaos: there exists an equilibrium x (λ) 1 For λ < λ 1, x is stable At λ = λ 1, f (x ) = 1 so a flip bifurcation occurs and a 2-cycle emerges 2 For λ 1 < λ < λ 2, the 2-cycle is stable At λ = λ 2, another flip bifurcation occurs and a 4-cycle emerges 3 In this pattern, 8-cycle, 16-cycle,, 2 n -cycle all occurs when λ increases, and this is a cascade of period-doubling bifurcations But all this happens for λ less than a finite number λ After that number λ, the solution is no longer periodic but chaotic What is chaos? The behavior of dynamical systems that are highly sensitive to initial conditions a response popularly referred to as the butterfly effect It is so called because of the title of a paper given by Edward Lorenz in 1972 to the American Association for the Advancement of Science in Washington, DC, entitled Predictability: Does the Flap of a Butterflys Wings in Brazil set off a Tornado in Texas? The flapping wing represents a small change in the initial condition of the system, which causes a chain of events leading to large-scale phenomena Had the butterfly not flapped its wings, the trajectory of the system might have been vastly different Example: logistic map x n+1 = rx n (1 x n ), Bellow s model: x n+1 = λx n 1 + xn b, b > 2

Graphing Graphing tools: (can be implemented via Matlab or other software) 1 plotting the recursive sequence 2 cobwebbing 3 bifurcation diagram (of chaotic dynamics) Typical models: 1 Logistic model: x n+1 = rx n (1 x n ) 2 Bellow s model: x n+1 = λx n 1 + b, b > 0 3 Ricker s model: x n+1 = λx ne kxn, k > 0 λx n 4 Hassel s model: x n+1 = (1 + x n) b, b > 0 5 Beverton-Holt model: x n+1 = λx n 1 + x n

Two species interactions Model: x n+1 = f (x n, y n, λ) y n+1 = g(x n, y n, λ) Equilibrium (x, y ): solve x = f (x, y, λ) and y = g(x, y, λ) Linearization: ( ) ( ) ( ) xn+1 fx (x =, y ) f y (x, y ) xn, linear matrix model! y n+1 g x (x, y ) g y (x, y ) y n Stability: If the eigenvalues λ 1, λ 2 satisfy λ 1 < 1 and λ 2 < 1, then (x, y ) is stable, otherwise it is unstable Bifurcation: occurs when λ i = 1 (transcritical, pitchfork, saddle-node, period-doubling and even more) Graphing tools: (can be implemented via Matlab or other software) 1 plotting the recursive sequence (same way) 2 cobwebbing (not so good any more) 3 bifurcation diagram (of chaotic dynamics) 4 Phase portrait (graph on (x, y) plane)

Host-Parasitoid Model Parasitoids are insects whose females lay their eggs in or on the bodies of the host insects Parasitoid eggs develop into parasitoid larvae at the expense of their host Hosts that have been parasitized thus give rise to the next generation of parasitoids, while only hosts that are not parasitized will give rise to the next generation of hosts Let H n and P n be the number of the hosts and parasitoids, respectively, at generation n Further, let f (H n, P n) be the fraction of hosts that are not parasitized Then f (H n, P n )H n =number of hosts not parasitized [1 f (H n, P n)]h n=number of hosts parasitized Assuming 1 The host population grows linearly in the absence of the parasitoids, with reproductive rate k > 1 2 The average number of eggs laid in a single host that give rise to adult parasitoids is c H n+1 = kf (H n, P n )H n, P n+1 = c[1 f (H n, P n )]H n

Nicholson-Bailey Model We assume that encounters between hosts and parasitoids occur at random and are independent (the latter means that parasitoids do not distinguish between hosts that have been parasitized and hosts that have not yet been parasitized) The Law of Mass Action, states that the number of encounters is proportional to the product H n P n, that is, ah np n, where a is the constant of proportionality representing the searching efficiency of the parasitoids The average number of encounters per host is thus ν = ah np n/h n = ap n Of course, not all hosts experience this many encounters Some will experience more, others less Let p(k) be the probability that a host experiences k encounters Since we assumed that encounters are random and independent, they are said to follow a Poisson process, and we can use the Poisson distribution for p(k) = νk e ν Recalling that we k! defined f (H n, P n ) to be the fraction of hosts not parasitized, then f (H n, P n) = p(0) = e ν = e apn (Nicholson-Bailey 1935) H n+1 = kh ne apn, P n+1 = ch n [1 e ap n ]

Population Genetics Model A given gene may have one of several forms, called alleles Suppose that there are two alleles, denoted by a and A, and that these are passed down in the population from one generation to the next A given individual could then have one of three combinations (called genotypes): AA, aa, or aa (The first two combinations are called homozygous, the last one heterozygous) A question we might explore is whether the relative frequencies of genes will change, and, if so, whether some new stable distribution will emerge Until 1914 it was believed that any rare allele would gradually disappear from a population After a more rigorous treatment of the problem it was shown that if mating is random and all genotypes (combinations of alleles, which in this case are AA, aa, and aa) are equally fit (have an equal likelihood of surviving to produce offspring), then gene frequencies do not change This fact is now known as the Hardy-Weinberg law Assumptions: 1 Mating is random 2 There is no variation in the number of progeny from parents of different genotypes 3 Progeny have equal fitness (that is, are equally likely to survive) 4 There are no mutations at any step

Population Genetics Model p = frequency of allele A, q = frequency of allele a, then p + q = 1 u = frequency of AA genotype, v = frequency of aa genotype, w = frequency of aa genotype p = u + 1 2 v, q = 1 2 v + w u n+1 = u 2 n + u nv n + 1 4 v 2 n v n+1 = u n v n + 2u n w n 1 2 v 2 n + v nw n w n+1 = w 2 n + w n v n + 1 4 v 2 n Hardy-Weinberg law: p n+1 = p n and q n+1 = q n