Chemical master equation 2026-09-28
For reactions with stoichiometric vectors and reaction propensity functions , the probability mass function obeysIt is the forward operator of a Markov jump process equation for the copy-number continuous-time Markov chain.
For a continuous-time Markov chain with transition rates , detailed balance isfor every pair of distinct states. A probability distribution satisfying these equations is an invariant distribution of a continuous-time Markov chain, because summing over incoming rates gives . Under the standard nonexplosion assumptions, the equilibrium chain is reversible.
The entry count counts jumps of a continuous-time Markov chain into state by time , excluding initial occupation. It is a counting process. For homogeneous transition intensities, its mean has derivative conditional on initial state , so its expected value is the sum of incoming rates times the expected occupation times of a continuous-time Markov chain. This density is an expected count rate, not necessarily a normalized probability density function.
Explosion of a continuous-time Markov chain Created 2026-09-24 Updated 2026-09-24
First-passage-time density Created 2026-09-29 Updated 2026-10-05
When a first-passage time has an absolutely continuous distribution, its density is , where is its survival function. In a continuous-time Markov chain, this density is the total probability flux from surviving states into the absorbing set.
Holding time Created 2026-09-29 Updated 2026-10-05
The holding time of a continuous-time Markov chain is the time spent in its current state before the next jump. In state it has an exponential distribution of rate equal to the total outgoing rate .
Interchange process 2026-10-06
Place one distinct label at each vertex of a finite connected weighted graph. At rate , interchange the labels at and . This continuous-time Markov chain has a uniform distribution on a finite set as its stationary distribution. The position of one label is the random walk with the same rates.
For a continuous-time Markov chain whose jump times tend to infinity, the chain and its jump chain have the same directed paths of positive-probability jumps. They are therefore irreducible simultaneously, and a state is recurrent for one exactly when it is recurrent for the other: the event of returning after departure depends only on the sequence of visited states.
Kolmogorov equations Created 2026-09-24 Updated 2026-10-03
For a finite-state continuous-time Markov chain with Q-matrix , the backward and forward equations are and , respectively.
A state's holding time in a time-homogeneous continuous-time Markov chain is exponentially distributed with rate . Its mean is ; the probability that its next jump is to state is . An absorbing state has infinite holding time.
If every holding rate of a continuous-time Markov chain is at most , its holding times can be coupled as , where the are independent rate-one exponential random variables. The strong law of large numbers gives almost surely, so the jump times tend to infinity and the chain cannot explode.
Nonexplosive Markov chain 2026-10-06
A continuous-time Markov chain is nonexplosive when it makes only finitely many jumps in every finite time interval, almost surely. Uniformly bounded total jump rates suffice. Another useful criterion bounds the states visited over each finite interval by a random finite set on which rates are bounded.
The occupation time records the duration spent in a state of a continuous-time Markov chain. Conditional on , its expected value is , where is the transition probability.
Open migration process 2026-10-06
An open migration process is a continuous-time Markov chain of colony populations with external Poisson processes, state-dependent departure rates, and fixed probabilistic routing that eventually exits the system. Its traffic equations of an open migration process determine the total arrival rates, and its equilibrium has a product-form stationary distribution of an open migration process when the normalizing sums are finite.