# Birth process

Short description: Type of continuous process in probability theory
A birth process with birth rates $\displaystyle{ \lambda_0, \lambda_1, \lambda_2, ... }$.

In probability theory, a birth process or a pure birth process[1] is a special case of a continuous-time Markov process and a generalisation of a Poisson process. It defines a continuous process which takes values in the natural numbers and can only increase by one (a "birth") or remain unchanged. This is a type of birth–death process with no deaths. The rate at which births occur is given by an exponential random variable whose parameter depends only on the current value of the process

## Definition

### Birth rates definition

A birth process with birth rates $\displaystyle{ (\lambda_n, n\in \mathbb{N}) }$ and initial value $\displaystyle{ k\in \mathbb{N} }$ is a minimal right-continuous process $\displaystyle{ (X_t, t\ge 0) }$ such that $\displaystyle{ X_0=k }$ and the interarrival times $\displaystyle{ T_i = \inf\{t\ge 0: X_t=i+1\} - \inf\{t\ge 0: X_t=i\} }$ are independent exponential random variables with parameter $\displaystyle{ \lambda_i }$.[2]

### Infinitesimal definition

A birth process with rates $\displaystyle{ (\lambda_n, n\in \mathbb{N}) }$ and initial value $\displaystyle{ k\in \mathbb{N} }$ is a process $\displaystyle{ (X_t, t\ge 0) }$ such that:

• $\displaystyle{ X_0=k }$
• $\displaystyle{ \forall s,t\ge 0: s\lt t\implies X_s \le X_t }$
• $\displaystyle{ \mathbb{P}(X_{t+h}=X_t+1)=\lambda_{X_t}h+o(h) }$
• $\displaystyle{ \mathbb{P}(X_{t+h}=X_t)=o(h) }$
• $\displaystyle{ \forall s,t\ge 0: s\lt t\implies X_t-X_s }$ is independent of $\displaystyle{ (X_u, u \lt s) }$

(The third and fourth conditions use little o notation.)

These conditions ensure that the process starts at $\displaystyle{ i }$, is non-decreasing and has independent single births continuously at rate $\displaystyle{ \lambda_n }$, when the process has value $\displaystyle{ n }$.[3]

### Continuous-time Markov chain definition

A birth process can be defined as a continuous-time Markov process (CTMC) $\displaystyle{ (X_t, t\ge 0) }$ with the non-zero Q-matrix entries $\displaystyle{ q_{n,n+1}=\lambda_n=-q_{n,n} }$ and initial distribution $\displaystyle{ i }$ (the random variable which takes value $\displaystyle{ i }$ with probability 1).[4]

$\displaystyle{ Q=\begin{pmatrix} -\lambda_0 & \lambda_0 & 0 & 0 & \cdots \\ 0 & -\lambda_1 & \lambda_1 & 0 & \cdots \\ 0 & 0 & -\lambda_2 & \lambda_2 & \cdots\\ \vdots & \vdots & \vdots & & \vdots \ddots \end{pmatrix} }$

### Variations

Some authors require that a birth process start from 0 i.e. that $\displaystyle{ X_0=0 }$,[3] while others allow the initial value to be given by a probability distribution on the natural numbers.[2] The state space can include infinity, in the case of an explosive birth process.[2] The birth rates are also called intensities.[3]

## Properties

As for CTMCs, a birth process has the Markov property. The CTMC definitions for communicating classes, irreducibility and so on apply to birth processes. By the conditions for recurrence and transience of a birth–death process,[5] any birth process is transient. The transition matrices $\displaystyle{ ((p_{i,j}(t))_{i,j\in\mathbb{N}}), t\ge 0) }$ of a birth process satisfy the Kolmogorov forward and backward equations.

The backwards equations are:[6]

$\displaystyle{ p'_{i,j}(t)=\lambda_i (p_{i,j+1}(t)-p_{i,j}(t)) }$ (for $\displaystyle{ i,j\in\mathbb{N} }$)

The forward equations are:[7]

$\displaystyle{ p'_{i,i}(t)=-\lambda_i p_{i,i}(t) }$ (for $\displaystyle{ i\in\mathbb{N} }$)
$\displaystyle{ p'_{i,j}(t)=\lambda_{j-1}p_{i,j-1}(t)-\lambda_i p_{i,j}(t) }$ (for $\displaystyle{ j\ge i+1 }$)

From the forward equations it follows that:[7]

$\displaystyle{ p_{i,i}(t)=e^{-\lambda_i t} }$ (for $\displaystyle{ i\in\mathbb{N} }$)
$\displaystyle{ p_{i,j}(t)=\lambda_{j-1}e^{-\lambda_i t}\int_0^t e^{\lambda_j s}p_{i,j-1}(s)\, ds }$ (for $\displaystyle{ j\ge i+1 }$)

Unlike a Poisson process, a birth process may have infinitely many births in a finite amount of time. We define $\displaystyle{ T_\infty=\sup \{T_n:n\in\mathbb{N}\} }$ and say that a birth process explodes if $\displaystyle{ T_\infty }$ is finite. If $\displaystyle{ \sum_{n=0}^\infty \frac{1}{\lambda_n}\lt \infty }$ then the process is explosive with probability 1; otherwise, it is non-explosive with probability 1 ("honest").[8][9]

## Examples

A Poisson process is a special case of a birth process.

A Poisson process is a birth process where the birth rates are constant i.e. $\displaystyle{ \lambda_n=\lambda }$ for some $\displaystyle{ \lambda\gt 0 }$.[3]

### Simple birth process

A simple birth process, where birth rates are equal to the size of the current population.

A simple birth process is a birth process with rates $\displaystyle{ \lambda_n=n\lambda }$.[10] It models a population in which each individual gives birth repeatedly and independently at rate $\displaystyle{ \lambda }$. Udny Yule studied the processes, so they may be known as Yule processes.[11]

The number of births in time $\displaystyle{ t }$ from a simple birth process of population $\displaystyle{ n }$ is given by:[3]

$\displaystyle{ p_{n,n+m}(t)=\binom{n}{m}(\lambda t)^m(1-\lambda t)^{n-m}+o(h) }$

In exact form, the number of births is the negative binomial distribution with parameters $\displaystyle{ n }$ and $\displaystyle{ e^{-\lambda t} }$. For the special case $\displaystyle{ n=1 }$, this is the geometric distribution with success rate $\displaystyle{ e^{-\lambda t} }$.[12]

The expectation of the process grows exponentially; specifically, if $\displaystyle{ X_0=1 }$ then $\displaystyle{ \mathbb{E}(X_t)=e^{\lambda t} }$.[10]

A simple birth process with immigration is a modification of this process with rates $\displaystyle{ \lambda_n=n\lambda+\nu }$. This models a population with births by each population member in addition to a constant rate of immigration into the system.[3]

## Notes

1. Upton & Cook (2014), birth-and-death process.
2. Norris (1997), p. 81.
3. Grimmett & Stirzaker (1992), p. 232.
4. Norris (1997), p. 81–82.
5. Ross (2010), p. 386.
6. Ross (2010), p. 389.
7. Norris (1997), p. 83.
8. Grimmett & Stirzaker (1992), p. 234.
9. Norris (1997), p. 82.
10. Ross (2010), p. 375.
11. Ross (2010), p. 383.