A birth-death process moves only between neighbouring nonnegative integer states, with state-dependent birth and death rates.
A pure birth process on jumps only from to , at a strictly positive rate . Its successive holding times are independent exponential variables of rates .
For a pure birth process with fixed initial state and finite statewise rates, the jump-count compensator gives , so is a local martingale up to explosion. If , a rate- Poisson candidate clock with accepted jumps of probability prevents explosion and dominates the jump count. Its finite exponential moments dominate every stopped on each finite horizon, upgrading the local martingale to a true martingale. A random initial state requires ; uniformly bounded rates do not supply this missing initial integrability.
The Logistic cell-division process is a density-limited pure birth model on , where is a positive integer carrying capacity. With cells, each divides at rate , so the total rate for is . Zero and are absorbing; a positive initial population can only increase until it reaches .
Let and assume in probability, for example . On every fixed finite interval , converges uniformly in probability toAn explicit martingale argument verifies this instance of the Kurtz fluid limit theorem. Compensating the jumps gives , with predictable quadratic variation at most . Doob's L2 maximal inequality gives . Since is Lipschitz on , Gronwall's inequality bounds the trajectory error by , which tends to zero in probability.
The finite-population mean need not itself solve the logistic equation: . The fluid limit follows because the fluctuations vanish on the specified finite horizons.
// Target: analysis.bigb
A pure birth process is nonexplosive exactly whenIts explosion time is the sum of independent exponential holding times. If the displayed series converges, that sum has finite expectation. If it diverges, the Laplace transform of the sum isforcing the sum to be infinite almost surely.
The pure birth process with rates , where , combines linear reproduction with immigration. Starting from zero, its mean satisfiesand hence
Add independent rate- resets to zero to a linear birth process with immigration. The resulting irreducible continuous-time Markov chain is nonexplosive by domination of births and finiteness of Poisson reset counts. When , an excursion from one reaches with probability , so its jump chain is recurrent with infinite expected jump count. The elapsed return-cycle time instead has meanThus the continuous-time chain is positive recurrent while its jump chain is null recurrent. Its stationary probabilities are and for .
The Yule process is the pure birth process with rate in population state . Starting from one individual, it is nonexplosive because the independent holding times have divergent total almost surely.
For , given , the birth times in a Yule process have the law of the order statistics of independent variables with densityThis follows by dividing the joint holding-time density by
.
.
For individual birth and death rates and one initial individual, the finite-time extinction probability satisfiesWhen ,
For birth rates and death rates , a reversible measure satisfiesThus , and it is an invariant distribution when the resulting measure is summable and the chain is nonexplosive.
For per-capita birth and death rates and , the rates are and . If and , thenThe expected value sees only the net growth rate , whereas the variance also sees the total event rate .
For a nonnegative integer-valued random variable, the displayed inversion is valid when . Indeed the gap between consecutive Jordan-Bonferroni exact-occurrence inequalities is , which tends to zero under this hypothesis. No exchange of an infinite signed sum with an expectation is needed.
If nonnegative integer-valued random variables have all fixed factorial moments converging to , then their convergence in distribution is to the Poisson distribution with mean . The first-moment bound gives uniform tightness, and bounds on higher moments give uniform integrability of each fixed lower moment. Every subsequential limit therefore has the indicated factorial moments. For such a limit and , the nonnegative binomial expansion and the monotone convergence theorem give . This identifies its moment-generating function as that of the Poisson distribution, uniquely determining the limit.
Poisson moment closure approximates a nonnegative integer-valued population law at each time by a Poisson distribution with its current mean . Its factorial moments then become ; in particular and .
For example, consider birth rates and death rates , with and . Assuming the relevant moments are finite, the exact first-moment equation isPoisson closure gives the Riccati equation . The exact identity shows what is discarded: the variance correction . Nonlinear rates do not generally preserve a Poisson distribution.
For the Batch-birth linear-death process, a Poisson initial law does remain Poisson. independent survival thins the initial Poisson population, and surviving immigrants form an independent Poisson population; their sum is Poisson. That gives an exact linear example, rather than making the nonlinear closure exact.[ref]
Lectures on the Poisson Process by Günter Last and others. Chapter 5: marking, thinning and superposition
A birth-death process with unit upward and downward jumps and rates and has infinitesimal generatorIf varies slowly over one jump, Taylor expansion through second order gives . Thus its diffusion approximation has drift coefficient and, in the conventiondiffusion coefficient . Equivalently it solves , where is Brownian motion. The sum measures the variance of the short-time increment: births and deaths both add noise even when their mean drifts cancel.
For a population density with jump size and birth/death rates , the drift is and the diffusion coefficient is . Fluctuations therefore shrink as . A useful approximation requires many reaction events while the rates change little; it can fail near an absorbing state or when only a few individuals remain. A continuous diffusion can even visit negative values unless its boundary treatment is specified. The approximation replaces the discrete jump model rather than asserting equality of their laws.[ref]
Stochastic Simulation of Chemical Kinetics by Daniel T. Gillespie. Section 4, printed pp. 44–46, equations (18)–(20), leap conditions and system-size scaling
The linear noise approximation replaces small fluctuations around a deterministic solution by a linear stochastic differential equation. For a stable equilibrium of drift , write . In one dimension with and local increment variance , the approximation is the Ornstein-Uhlenbeck processIts mean decays as . Applying Itô formula to gives , so its stationary Normal distribution has variance .
For constant immigration rate and linear death rate , the equilibrium is , , and . The stationary variance is therefore , matching the exact stationary Poisson distribution's mean and variance. The Normal distribution is a useful approximation when that mean is large; for small means it misses discreteness and assigns probability to negative populations. In several dimensions the drift is the Jacobian matrix at the equilibrium and the stationary covariance solves , a Continuous Lyapunov equation. Stability and sufficiently small fluctuations are essential: a zero restoring eigenvalue with nonzero noise has no finite stationary variance.
A reaction's stoichiometric vector outer product multiplied by its reaction propensity function is its contribution to the infinitesimal state-increment covariance. Summing over channels gives . Its normalized form divides by the two strictly positive mean copy numbers. The Fokker-Planck equation writes the associated second-derivative term with ; the covariance evolution and normalized stationary Lyapunov equation instead use and themselves. A simultaneous unit loss of two species contributes positive cross noise even when their long-time stationary covariance is negative.
Assume all equilibrium means are strictly positive. Let be the drift Jacobian at a stable mean-field equilibrium, , and the reaction noise matrix. For normalized fluctuations, put , , and . Stationarity of the linear-noise covariance gives the displayed Continuous Lyapunov equation. It applies to driven reaction networks without requiring thermal equilibrium. A mode with zero restoring eigenvalue and nonzero noise has no stationary covariance.
// Target: mathematical-biology.bigb
For RNA birth/death rates and protein rates , linearize at stationary means . Put . The relative-fluctuation drift is and the diffusion matrix is . The stationary covariance equation gives the displayed normalized protein variance. Its extrinsic part factors as : static susceptibility squared times a time-averaging factor times environmental noise. Faster response alone weakens averaging; feedback reduces susceptibility and thereby lowers noise. The formula is exact for affine rates when , and is a linear noise approximation for nonlinear feedback.
For a unit-jump population chain with one-step probabilities and , its equilibrium density is . Speed time by and center and scale the population as . The accelerated conditional drift is , and the second moment is . Their compact-set limits give the displayed Ornstein-Uhlenbeck process. If , the invalid-probability threshold stays a fixed positive density distance above equilibrium. Before that threshold, the generator of is at most one because its drift contribution is nonpositive. The stopped Lyapunov function bound proves compact containment and makes the probability of hitting that threshold on a fixed accelerated horizon tend to zero. This supplies the global hypotheses of the diffusion approximation theorem.
For a probability density on the whole real line, if the density and its derivatives decay sufficiently fast that all boundary terms vanish, two integrations by parts givewhile the diffusion term contributes zero to the first moment.
Consider a birth-death process on with constant birth rate , constant death rate at every positive state, and no deaths from zero. The reflecting boundary is essential: the result changes if zero is an absorbing state. Detailed balance would giveWhen , these weights normalize to a Geometric distribution, so the irreducible chain is positive recurrent. When , the embedded jump chain is the symmetric reflected random walk: it returns to zero almost surely, but its constant equilibrium weights have infinite sum, so the chain is null recurrent. When , its upward-biased embedded random walk has probability of hitting zero from state one, making the chain transient. The holding rates are bounded, so nonexplosion creates no additional qualification here.
An M/M/1 queue has a Poisson process of arrivals of rate , one server, independent exponential service times of rate , and unlimited waiting room. Arrivals are independent of service times. The two M symbols denote the memoryless arrival and service assumptions; the final one denotes the number of servers. Under a work-conserving service discipline, the queue population , including the customer in service, is a birth-death process with ratesThe server has no departure clock when the queue is empty. The traffic intensity is the server utilization in equilibrium when . Detailed balance then gives the Stationary distribution , whose mean is . For example, three arrivals per minute and four services per minute give and mean queue population three. Raising arrivals to per minute raises that mean to nineteen: operation near capacity amplifies congestion. These formulas count the customer being served as well as those waiting.[ref]
https://ocw.mit.edu/courses/2-854-introduction-to-manufacturing-systems-fall-2016/927056a1af54772a587fd84ad4951e71_MIT2_854F16_Mm1Queue.pdf. MIT 2.854 M/M/1 Queue notes, pages 1-2, system population and waiting population
With packet arrival rate lambda, independent exponential payloads of mean one and byte-service rate C, let . The number N of unfinished packets has law . Conditional on N=n, the remaining payloads are n independent unit-mean exponentials, including the in-service residual by memorylessness. Summing their Laplace transforms gives . Thus W has mass at zero and, conditional on positivity, is exponential with rate . The probability of at least r headers is instead for integer r.
If potential arrivals form a Poisson process of rate and an arrival seeing customers joins with probability , the queue length is a birth-death process with birth rate and death rate for . Its stationary ratios, when normalizable, are
In a stationary M/M/1 queue with independent Poisson arrivals of rate and exponential service times of rate , the departure counting process is a Poisson process of rate . Moreover, the departures before a fixed time are independent of the queue population . This independence concerns the past departures: future departures depend on whether the queue is currently empty.
The proof uses time reversal. The stationary Geometric distribution satisfies Detailed balance, , so the stationary queue population is a Reversible Markov chain. Departures in forward time are arrivals in reversed time. In the reversed chain the upward rate is again the constant , so those arrivals are an independent Poisson process, including independence of their future increments from the present queue population. Reversing time gives both assertions. Consequently, feeding the output of a stationary M/M/1 queue into another queue supplies Poisson input to that second queue. The claim depends on equilibrium; a queue started empty has no immediate departures even though arrivals have positive rate.
In an M-M-1 queue with Bernoulli feedback, external arrivals form a Poisson process of rate , service times are independent exponential random variables of rate , and each completed service independently returns its customer with probability . A returned customer immediately rejoins the same queue and requires a fresh service time. The queue population does not change at a feedback completion. Only completions that leave permanently produce downward jumps, at rate while the queue is nonempty.
For a continuously busy server, independent Bernoulli thinning of its Poisson completion clock gives an exponential time of rate until the next permanent departure. Thus the queue population has exactly the same birth-death process as an M/M/1 queue with service rate . It has a Stationary distribution precisely when ; its geometric parameter is then . This reduction describes the population and external departures, while individual customers can undergo several visits. For example, doubles the mean number of services needed per external customer from one to two.
In equilibrium, a Bernoulli-feedback queue has the same queue-length process as an ordinary queue with service rate , so its external departures form a Poisson process of rate .
The busy period of an M/M/1 queue starts with an arrival into an empty queue and ends the next time the queue becomes empty. Assume independent Poisson arrivals of rate and exponential service times of rate . If , its mean isOne derivation follows the family of customers generated during services. The initial customer's mean service time is ; during that service, the expected number of arrivals is . Each new arrival generates further arrivals during its own service. The expected total service time is therefore the nonnegative geometric series , which gives the formula. This argument can first be applied to finitely many generations and then justified by monotone convergence.
When , the busy period is finite almost surely but has infinite mean. When , it has probability of never ending; its extended mean is also infinite. Thus the divergence at critical load reflects a change in return behavior, not an infinite mean individual service time.
An queue has Poisson arrivals of rate , independent exponential service times of rate , and infinitely many servers. Its occupancy is a birth-death process with birth rate and death rate in state .
For every , an queue is positive recurrent and has the Poisson distribution with mean as its unique Stationary distribution:
In stationarity, the departure process of an queue is a Poisson process of rate . By time reversibility, the departures before any fixed time are independent of the occupancy at that time.
If and , thenwith independent summands. The binomial term counts surviving initial customers; Poisson thinning gives the surviving later arrivals.
Writing , the stationary empty probability is . Alternating idle periods of mean with busy periods and applying the renewal-reward theorem gives
An queue has arrivals forming a Poisson process of rate , servers with independent service times having an exponential distribution of rate , and total system capacity . Its occupancy is the finite birth-death process on with
Put . The unique Stationary distribution of an queue iswhere is the sum of the displayed weights. Adjacent terms satisfy detailed balance for a birth-death process, so the queue is reversible in equilibrium.
Articles by others on the same topic
There are currently no matching articles.