Skip to content
Tutorials Center
My learning

Topics

Lesson 16 of 46 ยท Discrete Dynamical Models

Discrete Models: Overview

Chapter 4 overview: models that change in steps, written as rules x(n+1) = f(x(n)). Meet savings, loans, populations and Fibonacci, with runnable examples.

Many things in life happen in steps. Interest is added once a month. Insects have one generation per summer. A game updates its world 60 times a second. A loan is paid down by instalments. For these situations the cleanest model is not a curve in continuous time but a rule that turns today's state into tomorrow's.

This chapter develops that idea: the rule, the sequence it creates, the special states where nothing changes, and the surprising behavior (including chaos) that even simple rules can produce.

Eleven bars show a balance growing five percent each year, linked by arrows, next to the rule x(n+1) = 1.05 x(n)
A discrete model is a rule applied again and again. Here the rule multiplies the balance by 1.05 every year.

The big picture

A discrete dynamical model has three ingredients:

  • a state xโ‚™ (a number, or a list of numbers) at step n = 0, 1, 2, ...
  • an update rule xโ‚™โ‚Šโ‚ = f(xโ‚™) that gives the next state from the current one
  • an initial condition xโ‚€

Together they generate the whole future: xโ‚€, xโ‚ = f(xโ‚€), xโ‚‚ = f(xโ‚), .... Such a rule is called a difference equation or recurrence relation. If f is simple, you can often find a formula for xโ‚™; if not, you can always run it on a computer.

Three questions run through the chapter:

  1. What happens in the long run? Growth, decay, settling to a steady state, cycling, or chaos?
  2. Where are the equilibria (fixed points), states with f(x*) = x*?
  3. Are those equilibria stable: if you nudge the system, does it return?

Some real examples with their rules:

Situation Rule Notes
Savings at 5% a year xโ‚™โ‚Šโ‚ = 1.05 xโ‚™ Pure growth
Loan with monthly payment P and monthly rate i xโ‚™โ‚Šโ‚ = (1 + i) xโ‚™ โˆ’ P Balance shrinks if P is large enough
Rabbit pairs (Leonardo of Pisa, 1202) Fโ‚™โ‚Šโ‚ = Fโ‚™ + Fโ‚™โ‚‹โ‚ Depends on two past values: second order
Insect generations xโ‚™โ‚Šโ‚ = r xโ‚™ (1 โˆ’ xโ‚™) The logistic map: crowded populations

Step by step

State x at step n
Rule next = f(this)
Start xโ‚€ given
1 / 3

What this chapter covers

Lesson You will learn
Difference Equations and Their Solutions Linear rules, closed forms, equilibria, loans and mortgages
The Logistic Map and Chaos Crowded populations, cobweb diagrams, stability, period doubling
Matrix Models: Leslie and Markov Age-structured populations and long-run growth rates
Chapter 4 Review A cobweb cheat sheet and a longer quiz

Try it

Write the rule as code. One function holds the update rule; a loop applies it. This pattern, state in, next state out, is how nearly every discrete model is simulated.

Python A generic iterator and three rules

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The next demo lets you change the growth factor r in x(n+1) = r ยท x(n) and watch ten steps. Try values just below, at and just above 1.

Linear growth explorer

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. In a discrete dynamical model, the update rule gives:

    x(n+1) = f(x(n)) turns today's state into tomorrow's.
  2. 2. What is a fixed point of the rule f?

    If the state is x* and f(x*) = x*, the next state equals the current one forever.
  3. 3. The Fibonacci rule F(n+1) = F(n) + F(n-1) depends on how many past values?

    It uses the last two terms, so it is a second-order recurrence.
  4. 4. A savings account follows x(n+1) = 1.05 x(n). Which long-run behavior do you expect?

    Multiplying by a factor above 1 each step makes the balance grow without bound.

Summary

  • A discrete model is a state, an update rule xโ‚™โ‚Šโ‚ = f(xโ‚™) and an initial condition.
  • Key questions: long-run behavior, equilibria f(x*) = x* and their stability.
  • Examples: savings, loans, Fibonacci rabbits, crowded populations.
  • Code pattern: one function for the rule, one loop that applies it.

Next: Difference Equations and Their Solutions