Birth-death recurrence classification Created 2026-09-24 Updated 2026-11-05
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 give
When , 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.
Geometric-arrival single-service queue Created 2026-10-14 Updated 2026-11-05
Let the independent arrivals satisfy , with and . During a busy period, each served customer produces further customers, so the total number served has the total-progeny law of a Galton-Watson process with mean . Its extinction probability solves and is the smaller of and . The queue is positive recurrent for , null recurrent for , and transient for . In the positive recurrent case its stationary distribution is .
Linear birth process with catastrophes Created 2026-10-14 Updated 2026-11-05
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 mean
Thus the continuous-time chain is positive recurrent while its jump chain is null recurrent. Its stationary probabilities are and for .
Null recurrent Markov chain Created 2026-10-31 Updated 2026-11-05
An irreducible Markov chain is null recurrent when every state is a null recurrent state: it returns to that state almost surely, but its mean recurrence time is infinite. Such a countable-state chain has no stationary distribution.
Null recurrent state Created 2026-09-24 Updated 2026-11-05
Recurrent Markov chain Created 2026-09-24 Updated 2026-11-05
A Recurrent Markov chain returns to its states rather than eventually leaving them forever. A state is recurrent if its positive first return time satisfies . A chain is recurrent when every state is recurrent. Within an irreducible class, recurrence is shared by every state, so testing one state suffices.
The Strong Markov property at successive return times shows that a Recurrent state is visited infinitely often almost surely when starting there. If its return Probability is , the number of visits including time zero has a geometric distribution on the positive integers, with mean . Consequently the Green-function criterion is
Tonelli's theorem identifies this sum with the expected number of visits. recurrence does not require a finite mean return time: null recurrence and positive recurrence distinguish infinite from finite mean recurrence time. simple symmetric random walk on the integers is null recurrent, whereas every finite irreducible chain is positive recurrent.
Reflected chain with geometric downward jumps Created 2026-10-14 Updated 2026-11-05
Fix and put . For independent geometric random variables with for , the Reflected chain with geometric downward jumps obeys . Its transition probabilities are for and .
The Probability of hitting zero from is one when and when . The first-step boundary equation at is essential for the extra exponent. Before reflection the mean increment is : downward drift corresponds to .
The chain is positive recurrent for , with Stationary distribution for . The ratio ensures these weights sum to one. It is null recurrent at and transient for . The parameter restriction matters: does not define the displayed geometric distribution, and produces deterministic upward motion rather than an irreducible chain.
Reflected nearest-neighbour random walk Created 2026-09-24 Updated 2026-11-05
On , let the chain jump from every to with probability and to with probability , and jump from zero to one. It is recurrent exactly when ; at it is null recurrent.
An irreducible Markov chain on a finite or countably infinite state space has at most one stationary distribution. On a countably infinite state space it exists exactly when the chain is positive recurrent. In that case, for every state ,
where is the first return time. The expression determines every component uniquely. The formula follows by dividing the one visit to in each return cycle by the mean recurrence time; the strong law of large numbers for successive cycles makes this occupation fraction precise.
Every irreducible finite Markov chain is positive recurrent and has exactly one stationary distribution. On an infinite state space, an irreducible null recurrent Markov chain or transient Markov chain has none. For example, the simple symmetric random walk on the integers is null recurrent. Aperiodicity affects convergence of the one-time laws, but is unnecessary for existence or uniqueness of a stationary distribution.