To see why continuous time removes periodicity, fix . Every finite sequence of Markov chain states connected by positive transition intensities has positive probability of finishing before , followed by no further transition until . Consequently the transition matrix has positive entries between every pair of communicating Markov chain states, including its diagonal. It is an irreducible Markov chain and an aperiodic Markov chain with stationary distribution . The countable-state Markov chain convergence theorem gives convergence at times , also in total variation distance. For , , applying contracts total variation distance and preserves , giving the full continuous-time limit.
Markov chain state 2026-10-25
A possible value of a Markov chain at one time. The collection of such values is its state space. A pair of molecule counts is one Markov chain state when two chemical species are tracked together.
Let . The law of total probability applied to the current markov chain state gives
The second equality holds because can only be reached from . Eliminating gives the linear recurrence relation
Write and . The three stoichiometric vectors are , and . The law of mass action gives the respective reaction propensity functions
In particular, producing the second chemical species does not consume the first chemical species. Since the two reactants in the third chemical reaction are different chemical species, the number of possible pairs is .
For each Markov chain state, the chemical master equation adds incoming probability flux and subtracts outgoing probability flux:
Here if either index is negative, and the initial condition is . These conventions also give the correct chemical master equation on the coordinate axes: for example, the third chemical reaction has zero outgoing reaction propensity function when either chemical species is absent.
At the empty Markov chain state, only the constant-rate production chemical reaction is possible. Thus the first-passage time has an exponential distribution of rate :
Its expected value can be obtained by integrating this survival function, and its second moment by integrating times the survival function:
Consequently the requested expected value and variance are
Conditioning on the observed time. The native PDF defines as the first production time and then conditions on that production occurring at . If the intended information is its numerical value , the answer depends on . We first compute this conditional probability using a conditional probability density; conditioning on an exact value of a continuous random variable means a density ratio, since .
Before , no molecules of the second chemical species are present, so the joint-removal chemical reaction cannot occur. Molecules of the first chemical species arrive as a rate- Poisson process, and each independently starts a clock with a rate- exponential distribution for producing the first molecule of the second chemical species. Define the unnormalized probability mass function
The chemical master equation before the first production, with production treated as killing, is
Multiplying by and summing gives a partial differential equation for the probability generating function:
Its solution, verifiable by direct differentiation, is
Thus , the survival function is , and the conditional distribution of given survival to is a Poisson distribution of mean .
Production in from Markov chain state has joint probability . Therefore the probability density function of is
The first production leaves unchanged. Taking the density ratio gives a size-biased distribution of the surviving count:
In particular, under this reading the requested conditional probability is
The shift by one matters: an observation made exactly when production occurs preferentially selects larger counts, since their production reaction propensity function is larger.
Without observing the numerical time. If the conditioning merely repeats the definition of , the requested probability is instead the unconditional count at that stopping time. Before production, increases by one at rate , while production occurs at rate in Markov chain state . The competing exponential clocks imply
The first factor requires a second arrival before production from count one; the second requires production before a third arrival. The first arrival itself is certain. Production eventually occurs with probability one, as is also clear from . As a consistency check, averaging the time-conditioned answer against gives
These are two distinct, explicitly specified interpretations of the printed conditioning.
A product-Poisson stationary distribution is suggested by balancing the three reaction fluxes around the directed cycle of reaction complexes. If their mean counts are , this complex balance condition is
which gives and . This suggests the joint probability mass function
It is normalized because it is the product of two Poisson distributions. We verify it directly in the chemical master equation, rather than assuming a product-Poisson stationary distribution theorem. The three incoming terms satisfy
With negative-index values set to zero, these identities also hold on the axes. Their sum equals , precisely the outgoing probability flux. The stationary average total exit rate is , so these stationary balance equations do define an invariant distribution of a continuous-time Markov chain for the nonexplosive model verified below. This is complex balance; it does not assert pairwise detailed balance for the irreversible chemical reactions.
To identify this invariant distribution with the limiting probability distribution in the question, first check that the model is a nonexplosive continuous-time Markov chain. On any finite time interval, is bounded by its initial count plus the finite number of arrivals in a rate- Poisson process. Conditional on that bound, the rate of producing is bounded, so only finitely many such productions occur. The number of joint removals cannot exceed the available molecules. Thus only finitely many chemical reactions occur in finite time.
The continuous-time Markov chain is also an irreducible Markov chain. From a Markov chain state with both counts positive, repeated joint removals reduce both. On the axis, producing one and then removing a pair reduces by one. On the axis, adding one and then removing a pair reduces by one. Each prescribed finite sequence has positive probability, so every Markov chain state reaches . Conversely, arrivals followed by productions reach any with ; to reach , reach and remove one pair. The continuous-time Markov chain is therefore positive recurrent, and the continuous-time Markov chain convergence theorem gives from the empty initial condition.
The two Poisson factors happen to have cancelling numerical coefficients at :