1 of 20

Simple Models

Carl�MMED 2025

000

2 of 20

Goals

Be able to

  • Create a “model world” & rules to run it
  • Distinguish “state” versus “parameter” and identify these for a “model world”
  • Explain the S-I-R “model world” and the Reed-Frost representation of it

2

0

3 of 20

What is the simplest, formal model of transmission?

3

0

4 of 20

Simplest?

  • least parameters, easiest to explain/analyze, linear

Formal Model?

  • unambiguous, mathematical rules

Transmission?

  • disease from one person to another

Answer:

  • ???
  • ???
  • ???
  • ???

4

0

5 of 20

Simplest?

  • Shortest-but-completist version of …

Formal Model?

  • unambiguous rules that …

Transmission?

  • can exhibit infection moving from one host to another

5

0

6 of 20

One element of your groups answer?

  • initially infected person
  • states: susceptible, infectious, recovered (it has three compartments)
  • constant infection rate
  • there is an arrow of time
  • there are differential equations

6

0

7 of 20

A Minimal Model

7

All hosts interact each step

I

S

Hosts are either infectious or susceptible

t=0

t=1

t=2

Time passes in fixed steps

Simplest: 2 hosts

If infected host interacts with a susceptible host, the susceptible host is infected on the next time step

0

8 of 20

Too simple?

Need to show transmission? Check.

But: models also need to show negatives - are there initial conditions where transmission DOESN’T occur?

Yes! Only see transmission with 1 I, 1 S - no transmission with 2 I or 2 S.

8

0

9 of 20

Stepping back: what was different for your model vs mine?

Some had different rules, but about the same “thing”. Some were about a different “thing”

We call the “thing” the model world: the collection of states and processes

Distinctly, the rules–how those processes work–is the model representation.

9

0

10 of 20

A Particular Less Minimal Model

10

Hosts are either Susceptible, Infectious, or Recovered

Interaction may or may not lead to infection

Many hosts

0

11 of 20

Quick check:

what’s new about the model world?

11

0

12 of 20

Let’s try it!

12

0

13 of 20

Get into groups of 4. You’re all Susceptible.

Initially, you all interact with me. Roll to see if you become Infected: a 1 or 2. I’m going to Recover.

On each subsequent round: if you are Susceptible, roll once for each Infected person in your group. After those rolls, all Infected people Recover.

Record how many people get Infected each round.

13

0

14 of 20

Plotting!

14

0

15 of 20

Question:

How many people did we expect to get infected in the first round?

15

0

16 of 20

Get into groups of 8. You’re all Susceptible.

Initially, you all interact with me. Roll to see if you become Infected: a 1. I’m going to Recover.

On each subsequent round: if you are Susceptible, roll once for each Infected person in your group. After those rolls, all Infected people Recover.

Record how many people get Infected each round.

16

0

17 of 20

Plotting!

17

0

18 of 20

Summary

  • start simple with model worlds, then build
  • model implementation should be incremental
  • model-thinking requires both creativity and specificity
  • Reed-Frost: very simple, but still provides insights
  • Surprise! We also introduced the�Basic Reproductive number, R0, and the�Effective Reproductive number, Reff!

18

0

19 of 20

Reed-Frost Model

  • Take a population of N hosts, one initially infected
  • Time proceeds in fixed steps
  • Hosts are either infected, susceptible, or removed
  • Each time step, all hosts interact
  • When an infected and susceptible host interact during a time step, there is a probability p that the susceptible host will become infectious on the next time step
  • All infected hosts at a time step become removed on the next time step�

19

0

20 of 20

Reed-Frost Model Math

  • All interactions instantaneous, independent, universal
  • Host counts at time steps: It, St, Rt
  • Rt+1 = It + Rt -- i.e., all infected become immune
  • For a particular susceptible,�P(infected @ t+1 | It) = 1 - (1-p)I = 1-qI

20

  • Therefore,�P(St+1 = St - x, It+l = x | St, It) = (1-qI)x(qI)S-x�

( )

St

x

0