8.01h, 8.01i - Modelling with recurrence relations

8.01h, 8.01i - Modelling with recurrence relations

Turn descriptions of births, deaths, arrivals and delayed effects into recurrence systems, and interpret what their solutions predict. In 8.01h you will build first-order models and use the integer-part function for individual counts; in 8.01i you will extend the modelling to second-order systems, including nonlinear rules and their limitations.

Births, deaths and the order of events

A model predicts that a population approaches 3535, but keeping whole individuals at every update makes it settle at 3131. How can the same growth rule produce those two forecasts? Rounding is itself part of a discrete model; you will investigate it after building the underlying rules.

Let PnP_n be the population at a specified census time, with nn counting equal time intervals. Births and deaths must refer to a stated population and a stated interval. A fraction of the current population differs from a fixed number removed each year.

You already know

A recurrence system needs its initial value or values and the range of nn. Linear systems can be solved by complementary functions and particular solutions. A steady state remains unchanged by the update; solving its equation alone does not prove convergence.

Suppose births during an interval are modelled as bPnbP_n, deaths as dPndP_n, and II individuals arrive after those changes. Then the next census is

Pn+1=Pn+bPn−dPn+I=(1+b−d)Pn+IP_{n+1}=P_n+bP_n-dP_n+I=(1+b-d)P_n+I

This assumes both rates act on the starting population. If births or arrivals happen before the population used for deaths is counted, the formula must reflect that different timing.

A discrete population model

A discrete population model predicts counts at separate census times by an update rule. Rates such as bb and dd are fractions per interval; II is a count per interval. A deterministic real-valued output can represent an approximate or average population, but cannot be an exact count of indivisible individuals. The birth-and-death update above is not in the formula booklet: construct it from the stated assumptions.

Write down what is counted at the start and what happens before the next count. That timeline prevents a percentage from being applied to the wrong total.

Worked example 1: arrivals after the population change

Question. A population starts at 100100. During each year, births and deaths are modelled as 20%20\% and 30%30\% of the population at the start of the year. Then 2020 individuals are added. Form a recurrence system, solve it and find its long-term prediction.

Plan. Combine the two rates on the starting population, add the arrivals, then solve the linear system.

Pn+1=(1+0.2−0.3)Pn+20=0.9Pn+20census updateP0=100,n≥0initial condition and rangeL=0.9L+20⇒L=200constant particular solutionPn=C(0.9)n+200general solutionC=−100P0=100\begin{aligned} P_{n+1}&=(1+0.2-0.3)P_n+20=0.9P_n+20 && \text{census update} \\ P_0&=100,\qquad n\ge0 && \text{initial condition and range} \\ L&=0.9L+20\quad\Rightarrow\quad L=200 && \text{constant particular solution} \\ P_n&=C(0.9)^n+200 && \text{general solution} \\ C&=-100 && P_0=100 \end{aligned}

Why this step? The 2020 arrivals occur after the percentage changes, so they are not reduced by that year's net loss.

Answer. Pn=200−100(0.9)nP_n=200-100(0.9)^n, so the model predicts a population approaching 200200.

Check. P1=110P_1=110, P2=119P_2=119; both agree with direct updates, and the closed form proves convergence since 0.9n→00.9^n\to0.

The next example changes only the timing of the arrivals. The rates now act on the enlarged starting population.

Worked example 2: arrivals before the population change

Question. Use the same initial population and rates, but add the 2020 individuals before applying that year's births and deaths. Form and solve the new system, and find its long-term prediction.

Plan. Put the arrivals inside the population to which the net factor 0.90.9 is applied.

Qn+1=0.9(Qn+20)=0.9Qn+18new event orderQ0=100,n≥0same initial censusL=0.9L+18⇒L=180particular solutionQn=C(0.9)n+180,C=−80apply Q0=100\begin{aligned} Q_{n+1}&=0.9(Q_n+20)=0.9Q_n+18 && \text{new event order} \\ Q_0&=100,\qquad n\ge0 && \text{same initial census} \\ L&=0.9L+18\quad\Rightarrow\quad L=180 && \text{particular solution} \\ Q_n&=C(0.9)^n+180,\qquad C=-80 && \text{apply }Q_0=100 \end{aligned}

Why this step? Those arriving now experience the same year's net reduction, so their contribution to the next census is 1818, not 2020.

Answer. Qn=180−80(0.9)nQ_n=180-80(0.9)^n, approaching 180180.

Check. Q1=108Q_1=108, Q2=115.2Q_2=115.2. The different timing changes the limiting forecast by 2020.

These model solutions are not in the formula booklet: derive them from the description. Constant rates and unchanged conditions are assumptions; crowding, varying food supply or a changing arrival policy may require a different update.

Watch out

Wrong: interpret a 30%30\% death rate as subtracting 3030 individuals. Right: subtract 0.3Pn0.3P_n when the rate applies to the population PnP_n. A fixed removal and a percentage removal are different models.

State your population's census time before writing a formula; the same words can otherwise conceal different event orders.

Density dependence and competing steady states

A fixed percentage growth model can increase without bound. A density-dependent rate lets the change depend on how crowded the population already is.

For example, Pn+1=1.5Pn−0.001Pn2P_{n+1}=1.5P_n-0.001P_n^2 has increment 0.001Pn(500−Pn)0.001P_n(500-P_n): it is positive below 500500 and negative above 500500, while positive populations are considered. A sign of the increment gives direction; a bound is still needed to prevent overshooting.

Density-dependent growth

A density-dependent model has a per-individual growth or survival contribution that changes with population size. A term such as −kPn2-kP_n^2, for k>0k>0, reduces growth more strongly at larger populations. Such a rule is nonlinear and need not have the linear closed forms from earlier lessons. Particular density-dependent formulae are not in the formula booklet: interpret the model supplied.

When there is more than one steady state, use the initial condition and the behaviour of the updates to select the one reached. A quadratic equation does not make both roots valid long-term predictions for the same initial population.

Worked example 3: growth towards a positive steady state

Question. A model is P0=450P_0=450, Pn+1=1.5Pn−0.001Pn2P_{n+1}=1.5P_n-0.001P_n^2. Show that the population increases towards 500500.

Plan. Find the steady states, then show each update stays below 500500 while increasing.

For f(P)=1.5P−0.001P2f(P)=1.5P-0.001P^2,

L=f(L)⇒L(500−L)=0steady states 0,500f(P)−P=0.001P(500−P)>00<P<500500−f(P)=0.001(P−500)(P−1000)>00<P<500\begin{aligned} L=f(L)&\quad\Rightarrow\quad L(500-L)=0 && \text{steady states }0,500 \\ f(P)-P&=0.001P(500-P)>0 && 0<P<500 \\ 500-f(P)&=0.001(P-500)(P-1000)>0 && 0<P<500 \end{aligned}

Thus an update from (0,500)(0,500) stays in that interval and is larger than its input. Starting at 450450, the sequence is increasing and bounded above, so it converges. Its limit is at least 450450, excluding 00.

Why this step? The second inequality rules out an overshoot; the direction of the first increment alone would not prove the entire sequence increases.

Answer. The model converges monotonically to 500500.

Check. P1=472.5P_1=472.5, P2=485.49375P_2=485.49375, consistent with the proved bound and direction.

The next example changes only the policy: 4040 individuals are removed after each update. This creates two positive steady states.

Worked example 4: selecting between two positive roots

Question. The modified model is Q0=450Q_0=450, Qn+1=1.5Qn−0.001Qn2−40Q_{n+1}=1.5Q_n-0.001Q_n^2-40. Show that the population decreases towards 400400.

Plan. Find both candidate limits, then keep the sequence above the larger root while showing it decreases.

Writing g(Q)=1.5Q−0.001Q2−40g(Q)=1.5Q-0.001Q^2-40,

L=g(L)⇒(L−100)(L−400)=0candidate limitsg(Q)−Q=−0.001(Q−100)(Q−400)<0400<Q≤450g(Q)−400=−0.001(Q−400)(Q−1100)>0400<Q≤450\begin{aligned} L=g(L)&\quad\Rightarrow\quad (L-100)(L-400)=0 && \text{candidate limits} \\ g(Q)-Q&=-0.001(Q-100)(Q-400)<0 && 400<Q\le450 \\ g(Q)-400&=-0.001(Q-400)(Q-1100)>0 && 400<Q\le450 \end{aligned}

Each update stays above 400400 and below its previous value, so the sequence converges to a limit at least 400400. Of the candidates, only 400400 is possible.

Why this step? The lower bound selects the larger root; listing 100100 and 400400 would not decide the model's prediction.

Answer. The model decreases monotonically to 400400.

Check. Q1=432.5Q_1=432.5, between 400400 and 450450.

The same initial population now lies above the new equilibrium, so the direction reverses. Both limit arguments and factorisations are not in the formula booklet: construct them for the given model.

Watch out

Wrong: solve the fixed-point equation and choose whichever root looks realistic. Right: connect a root to the initial population using a justified interval and direction, or the convergence information supplied in the question.

Population rules may give negative outputs outside the region for which they were designed. That reveals a limitation of the model, rather than a meaningful negative number of organisms.

Integer-part updates for whole individuals

Keeping a whole-number population means changing the update itself, rather than rounding the final real-valued answer.

For non-negative xx, INT⁡(x)\operatorname{INT}(x) is the integer part of xx: for example, INT⁡(12.9)=12\operatorname{INT}(12.9)=12, while INT⁡(12)=12\operatorname{INT}(12)=12. It rounds down for the non-negative quantities used here; it does not round to the nearest integer.

An integer-part update

For non-negative xx,

INT⁡(x)=m⟺m≤x<m+1\operatorname{INT}(x)=m\quad\Longleftrightarrow\quad m\le x<m+1

where mm is an integer. In an integer recurrence, use each rounded output as the input to the next update.
Not in the formula booklet: learn it.

Rounding may be appropriate for a rule that retains whole survivors, but it can bias a forecast downwards. The rounding convention is a modelling assumption, not a claim that rounding down is always the most accurate biological description.

Worked example 5: rounding changes the limiting count

Question. Compare x0=29, xn+1=0.8xn+7x_0=29,\ x_{n+1}=0.8x_n+7 with p0=29, pn+1=INT⁡(0.8pn+7)p_0=29,\ p_{n+1}=\operatorname{INT}(0.8p_n+7). Find the limiting prediction of each.

Plan. Solve the real-valued linear model; iterate the integer model until a value repeats.

xn=35−6(0.8)n⟶35solve the linear systemp1=INT⁡(30.2)=30start with 29p2=INT⁡(31)=31use the rounded 30p3=INT⁡(31.8)=31use the rounded 31\begin{aligned} x_n&=35-6(0.8)^n\longrightarrow35 && \text{solve the linear system} \\ p_1&=\operatorname{INT}(30.2)=30 && \text{start with }29 \\ p_2&=\operatorname{INT}(31)=31 && \text{use the rounded }30 \\ p_3&=\operatorname{INT}(31.8)=31 && \text{use the rounded }31 \end{aligned}

Once 3131 maps to itself, every later integer-model value is 3131.

Why this step? The second integer update uses 3030, not the real-valued first output 30.230.2. Rounding after completing the real-valued iteration would describe a different sequence.

Answer. The real-valued model tends to 3535; the integer model becomes constant at 3131.

Check. 0.8(31)+7=31.80.8(31)+7=31.8, whose integer part is 3131.

The next example changes only the initial count. Unlike the real-valued model, the integer model need not reach the same steady state.

Worked example 6: several integer steady states

Question. Start both models instead at 3434. Find their limiting predictions and identify every non-negative integer steady state of the integer model.

Plan. Check the first integer update, then express the fixed-point condition using the defining inequalities for INT⁡\operatorname{INT}.

xn=35−(0.8)n⟶35x0=34p1=INT⁡(0.8(34)+7)=INT⁡(34.2)=34fixed immediatelym≤0.8m+7<m+1integer steady-state conditionm≤35,m>30solve both inequalities\begin{aligned} x_n&=35-(0.8)^n\longrightarrow35 && x_0=34 \\ p_1&=\operatorname{INT}(0.8(34)+7)=\operatorname{INT}(34.2)=34 && \text{fixed immediately} \\ m&\le0.8m+7<m+1 && \text{integer steady-state condition} \\ m&\le35,\qquad m>30 && \text{solve both inequalities} \end{aligned}

Why this step? An integer value remains fixed whenever the unrounded output lies anywhere from that value up to, but not including, the next integer.

Answer. The limits are 3535 and 3434, respectively. The integer steady states are 31,32,33,34,3531,32,33,34,35.

Check. At m=35m=35, the output is exactly 3535; at m=30m=30, the output is 3131, so 3030 is not fixed.

Continue this lesson.

You’re previewing NovaLearn without an account. Create a free account to read the rest.

Create free account