Death process

-

 

Defining the death process

Consider a population where individuals only die, and nobody is born. We now study the death process under the following assumptions.

  1. The probability that each individual dies in a short period of time \(\delta t\) is \(\mu\delta t + o(\delta t)\) where \(\mu > 0\) is the death rate.
  2. For a population of \(n\) individuals, the probability of each death is \(n\mu\delta t + o(\delta t)\). We assume that the probability of multiple deaths in \(\delta t\) is negligible. 
Thus, the population size \(N(t)\) is a random variable that only decreases. Let \[p_n(t) = \Pr(N(t) = n),\] the probability that the population size is \(n\) at time \(t\). Suppose the initial population size is \(N(0) = n_0\), and hence the initial condition is given as \[p_{n}(t) = \delta_{n,n_0}. \tag{Eq:Init}\]

A sample path of a death process is shown below:


Differential-difference equations

Now, let's find the differential-difference equations for the death process.
First, suppose that \(N(t) = n_0\), the initial population size. The population can retain this size at time \(t + \delta t\) only if there are no deaths during \(\delta t\). Thus,
\[p_{n_0}(t + \delta t) = p_{n_0}(t)(1 - \mu n_0\delta t + o(\delta t)).\]

Next, for \(N(t+\delta t) = n\) to hold, there are two possibilities:
  • \(N(t) = n + 1\) and one individual dies during \(\delta t\), or
  • \(N(t) = n\), and no individuals die during \(\delta t\).
Hence, we have the following equation:
\[p_n(t+\delta t) = [\mu(n+1)\delta t + o(\delta t)]p_{n+1}(t) + [1 - \mu n\delta t + o(\delta t)]p_n(t), ~~ (n \leq n_0 - 1).\]
In particular, we have, for \(n = 0\),
\[p_0(t+\delta t) = [\mu\delta t + o(\delta t)]p_1(t) + [1 + o(\delta t)]p_0(t).\]

Rearranging these, and taking the limit \(\delta t \to 0\), we have the following differential-difference equations:
\[\begin{eqnarray} \frac{{d}p_n(t)}{{d}t} &=& \mu(n+1) p_{n+1}(t) - \mu np_n(t),~~(0 \leq n \leq n_0 - 1)\tag{Eq:DeathN}\\ \frac{{d}p_{n_0}(t)}{{d}t} &=& - \mu n_0p_{n_0}(t)\tag{Eq:DeathN0}. \end{eqnarray}\]

In the next post, we will solve these equations and show that \(\{p_n(t)\}\) is given by
\[p_n(t) = \binom{n_0}{n}e^{-n\mu t}(1 - e^{-\mu t})^{n_0 - n}, ~~ (0 \leq n \leq n_0).\]
That is, \(N(t)\) follows the binomial distribution \(\mathrm{B}(n_0, e^{-\mu t})\).

Generating function equation

We can similarly solve the above equations as the birth process. The probability generating function for this death process is defined as \[G(s,t) = \sum_{n=0}^{n_0}p_n(t)s^n.\tag{Eq:PGF}\] Note the sum is now from \(n = 0\) to \(n = n_0\).
As usual (by now), multiply the both sides of (Eq:DeathN) by \(s^n\) and sum over \(n\) to have
\[\sum_{n=0}^{n_0}\frac{{d}p_n(t)}{{d}t}s^n =\mu\sum_{n=0}^{n_0-1}(n+1) p_{n+1}(t)s^{n} - \mu\sum_{n=1}^{n_0}np_n(t)s^{n}.\]
By now, you should be able to see that this equation implies the following:
\[\frac{\partial G(s,t)}{\partial t}=\mu (1-s)\frac{\partial G(s,t)}{\partial s},\]
and the initial condition (Eq:Init) reads
\[G(s, 0) = s^{n_0}.\tag{Eq:InitG}\]
By employing the same technique as in the birth process, we can show (exercise!) that
\[\begin{eqnarray} G(s,t) &=& (1 - e^{-\mu t} - se^{-\mu t})^{n_0}\\ &=& \sum_{n=0}^{n_0}\binom{n_0}{n}e^{-n\mu t}(1 - e^{-\mu t})^{n_0 - n}s^{n}. \end{eqnarray}\]
Hence, we have
\[p_n(t) = \binom{n_0}{n}e^{-n\mu t}(1 - e^{-\mu t})^{n_0 - n}, ~~ (0 \leq n \leq n_0).\]
This is the binomial distribution \(\mathrm{B}(n_0, e^{-\mu t})\).

Probability of extinction

The probability of extinction at time \(t\) is 
\[p_0(t) = (1 - e^{-\mu t})^{n_0}.\]
The mean population size decreases exponentially:
\[\mathbb{E}(N(t)) = n_0e^{-\mu t}.\]
In fact, the probability of ultimate extinction is
\[\lim_{t\to\infty}p_0(t) = \lim_{t\to\infty}(1 - e^{-\mu t})^{n_0} = 1\]
so that the population will become extinct almost surely.

Related videos







Comments

Post a Comment

Popular posts from this blog

Open sets and closed sets in \(\mathbb{R}^n\)

-
Image
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an  open set  if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is  not  an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
Read more

Euclidean spaces

-
Image
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
Read more

Newton's method

-
Image
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.  Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,  \[\lim_{n\to\infty}c_n = \alpha,\] and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\). Theorem (Newton's method) Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions: \(f(a) < 0\) and \(f(b) > 0\); For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\). Let us define the sequence \(\{c_n\}\) by \[ \begin{eqnarray} c_1 &
Read more