
310 4 Mechanistic Models II: PDEs
This model is known as the Nicholson–Bailey model. Althoughwewillnotgo
into a detailed discussion of these equations here, it is easy to understand the
message in qualitative terms: Equation 4.153 says that the hosts grow proportional
to the existing number of hosts, that is, in an exponential fashion similar to the
description of yeast growth in Section 3.10.2. If there are many parasites, e
−γ P
t
will
be close to zero, and hence the host growth rate will also go to zero. In a similar
way, Equation 4.154 expresses the fact that the number of parasites will increase
with the number of surviving eggs, the number of host species, and the number of
parasite species in the previous breeding season.
Mathematically, Equations 4.153 and 4.154 are classified as difference equations,
recurrence relations,ordiscrete models [114, 220]. Models of this kind are characterized
by the fact that the model equations can be used to set up an iteration that yields
a sequence of states such as (N
1
, P
1
), (N
2
, P
2
), .... In the above example and many
other applications of this kind, the iteration number t = 1, 2, 3, ... corresponds
to time, that is, time is treated as a discrete variable. Note the difference to
the differential equation models above, in which time and other independent
variables were treated as continuous quantities. As the above example shows,
finite difference models provide a natural setting for problems in the field of
population dynamics, but they can also be used to model other inherently discrete
phenomena, e.g. in the field of economics, traffic, or transportation flows [220,
221]. Difference equations such as Equations 4.153 and 4.154 can be easily
implemented using Maxima or R as described above. The iterations can be
formulated similar to the book software program
HeatClos.r that was discussed
in Section 4.6.3.
4.11.2
Cellular Automata
The concept of cellular automata was developed by John von Neumann and
Stanislaw Ulam in the early 1950s, inspired by the analogies between the operation
of computers and the human brain [222, 223]. We begin with a definition of cellular
automata and then consider an illustrative example [224]:
Definition 4.11.1 (Cellular automaton) A cellular automaton consists of
•
a regular, discrete lattice of cells (which are also called nodes or
sites) with boundary conditions;
•
a finite – typically small – set of states that characterizes the
cells;
•
a finite set of cells that defines the interaction neighborhood of
each cell; and
•
rules that determine the evolution of the states of the cells in
discrete time steps t = 1, 2, 3, ....