2.1 Simple Models 45
Of course, whatever the form of f (N
t
), we are only interested in nonnegative popula-
tions.
The skill in modelling a specific population’s growth dynamics lies in determining
the appropriate form of f (N
t
) to reflect known observations or facts about the species
in question. To do this with any confidence we must understand the major effects on the
solutions of changes in the form of f (N
t
) and its parameters, and also what solutions
of (2.1) look like for a few specimen examples of practical interest. The mathematical
problem is a mapping one, namely, that of finding the orbits, or trajectories, of nonlinear
maps given a starting value N
0
> 0. It should be noted here that there is no simple con-
nection between difference equation models and what might appear to be the continuous
differential equation analogue, even though a finite difference approximation results in
a discrete equation. This becomes clear below.
Suppose the function F(N
t
) = r > 0; that is, the population one step later is simply
proportional to the current population. Then from (2.1),
N
t+1
= rN
t
⇒ N
t
= r
t
N
0
. (2.2)
So the population grows or decays geometrically according to whether r > 1orr < 1
respectively; here r is the net reproductive rate. This particularly simple model is not
very realistic for most populations nor for long times but, even so, it has been used with
some justification for the early stages of growth of certain bacteria. It is the discrete
version of Malthus’ model in Chapter 1. A slight modification to bring in crowding
effects could be
N
t+1
= rN
S
, N
S
= N
1−b
t
, b constant,
where N
S
is the population that survives to breed. There must be restrictions on b of
course, so that N
S
≤ N
t
otherwise those surviving to breed would be more than the
population of which they form a part.
Fibonacci Sequence
Leonardo of Pisa, who was only given the nickname Fibonacci in the 18th century, in
his arithmetic book of 1202 set a modelling exercise involving an hypothetical growing
rabbit population. It consists of starting at the beginning of the breeding season with
a pair of immature rabbits, male and female, which after one reproductive season pro-
duce two pairs of male and female immature rabbits after which the parents then stop
reproducing. Their offspring pairs then do exactly the same and so on. The question is
to determine the number of pairs of rabbits at each reproductive period. If we denote the
number of pairs of (male and female) rabbits by N
t
then normalising the reproductive
period to 1 we have at the tth reproductive stage
N
t+1
= N
t
+ N
t−1
, t = 2, 3,... . (2.3)
This gives, with N
0
= 1, what is known as the Fibonacci sequence, namely
1, 1, 2, 3, 5, 8, 13,... .