Math 2.0

Probability theory and stochastic processes Definition

Birth–death process

Builds on Continuous-time Markov chainStationary distribution

Definition

Let S={0,1,2,…}S = \set{0, 1, 2, \ldots}, and let (λn)n≥0(\lambda_n)_{n \ge 0} and (μn)n≥1(\mu_n)_{n \ge 1} be nonnegative real numbers, with μ0=0\mu_0 = 0. Let (Xt)t≥0(X_t)_{t \ge 0} be a continuous-time Markov chain on SS with generator matrix Q=(qmn)Q = (q_{mn}). It is a birth–death process with birth rates λn\lambda_n and death rates μn\mu_n if qn,n+1=λn,qn,n−1=μn (n≥1),qnn=−(λn+μn),q_{n, n+1} = \lambda_n, \qquad q_{n, n-1} = \mu_n \ (n \ge 1), \qquad q_{nn} = -(\lambda_n + \mu_n), and qmn=0q_{mn} = 0 when ∣m−n∣≥2\abs{m - n} \ge 2. A finite version uses S={0,1,…,N}S = \set{0, 1, \ldots, N} with λN=0\lambda_N = 0.

Remarks

In state nn the process waits an exponential time of rate λn+μn\lambda_n + \mu_n, then jumps to n+1n + 1 with probability λn/(λn+μn)\lambda_n / (\lambda_n + \mu_n) and to n−1n - 1 otherwise. Example: the Poisson process of rate λ\lambda is the pure birth process with λn=λ\lambda_n = \lambda and μn=0\mu_n = 0 for all nn; each row of QQ sums to 00, as required. Non-example: a chain on SS with qn,n+2>0q_{n, n+2} > 0 for some nn is not a birth–death process, because it jumps by two. Suppose all λn>0\lambda_n > 0 and all μn>0\mu_n > 0 for n≥1n \ge 1, and the chain does not explode. Then a stationary distribution exists if and only if ∑n≥0λ0λ1⋯λn−1μ1μ2⋯μn<∞,\sum_{n \ge 0} \frac{\lambda_0 \lambda_1 \cdots \lambda_{n-1}}{\mu_1 \mu_2 \cdots \mu_n} < \infty, and then πn\pi_n is proportional to the nn-th term of this sum. It follows from the balance equations πnλn=πn+1μn+1\pi_n \lambda_n = \pi_{n+1} \mu_{n+1}.

Reading path

To understand this page from the ground up, read these 54 pages in order. The foundations come first.

  1. Construction of the reals from Cauchy sequences concept
  2. Continuous-time Markov chain concept
  3. Element definition
  4. Integers object
  5. Ordered field definition
  6. Proposition concept
  7. Random experiment concept
  8. Rational numbers object
  9. Real numbers object
  10. Set definition
  11. Ring of integers statement
  12. Disjunction definition
  13. Implication definition
  14. Predicate definition
  15. Ordered pair definition
  16. Union definition
  17. Sample space definition
  18. Existential quantifier definition
  19. The rationals form a field statement
  20. Universal quantifier definition
  21. Cartesian product definition
  22. Subset definition
  23. The rationals form an ordered field statement
  24. Uniqueness quantifier definition
  25. Binary relation definition
  26. Universal set definition
  27. Order on the reals definition
  28. Power set definition
  29. Complement definition
  30. Function definition
  31. Interval definition
  32. Injective function definition
  33. Preimage of a set definition
  34. Sigma-algebra definition
  35. Countable set definition
  36. Event definition
  37. Borel sigma-algebra definition
  38. Probability axioms concept
  39. Probability measure definition
  40. Probability space definition
  41. Conditional probability definition
  42. Random variable definition
  43. Independence of two events definition
  44. Discrete random variable definition
  45. Stochastic process concept
  46. Random variable with a density definition
  47. Conditional independence definition
  48. Expected value definition
  49. Conditional expectation definition
  50. Markov property definition
  51. Markov chain definition
  52. Transition matrix definition
  53. Stationary distribution definition
  54. Birth–death process definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Birth–death_process
About this page
TagFV0E9GEPCD
URIm2://FV0E9GEPCD
Kinddefinition
WritingW0 stub
MSC60J27, 60J80, 60K25
DefinesBirth–death process
UsesContinuous-time Markov chain, Stationary distribution
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.