Peres product condition Created 2026-10-06 Updated 2026-11-05
For finite irreducible Markov chains that are aperiodic Markov chains and reversible Markov chains, the ratio definition of cutoff and imply the Peres product condition, with . If on a subsequence, then and the eigenvalue lower bound for total variation mixing give
For sufficiently small fixed , this contradicts the limit one forced by cutoff for Markov chains. The same argument proves the stronger conclusion .
Periodic Markov chain Created 2026-09-24 Updated 2026-11-05
For a state of a Markov chain, its period is the greatest common divisor of the positive return lengths,
A state is periodic when . All states in an irreducible class have the same period: paths connecting two states transfer return cycles between them. A reducible chain can have classes of different periods, so a single period for the whole chain requires qualification.
The deterministic two-state chain has period two: its distributions alternate forever despite the existence of the uniform Stationary distribution. More generally, an irreducible nearest-neighbour walk on a bipartite graph alternates its two vertex classes. A positive holding probability at any state of an irreducible class supplies a one-step return and makes the entire class aperiodic. Aperiodicity therefore concerns possible return lengths rather than merely the existence of an invariant law.
Poincare inequality for a reversible Markov chain Created 2026-10-06 Updated 2026-10-14
For a finite irreducible Markov chain with at least two states satisfying detailed balance, its Dirichlet form of a Markov chain obeys
Expand in an orthonormal eigenbasis. The denominator is , and the numerator is . Their ratio is at least and equality holds for the second eigenfunction. Thus the optimal Poincare inequality for a reversible Markov chain constant is , for the ordinary rather than absolute spectral gap.
Poisson Metropolis chain 2026-10-25
A Poisson Metropolis chain samples a Poisson distribution by proposing an upward or downward unit step with equal probability and reflecting a downward proposal at zero into a self-proposal. Its upward and downward transition probabilities are the displayed , with , and the diagonal entry is . For , adjacent stationary fluxes equal . Hence detailed balance holds. Positive adjacent probabilities imply an irreducible Markov chain; implies aperiodicity. The normalized invariant Poisson distribution implies positive recurrence, so the countable-state Markov chain convergence theorem applies. The boundary proposal probability is essential: forcing every proposal at zero to go upward would require a different acceptance ratio.
Positive Harris recurrent Markov chain Created 2026-10-06 Updated 2026-11-05
Positive recurrent Markov chain Created 2026-10-06 Updated 2026-11-05
An irreducible Markov chain is positive recurrent when its mean return times are finite. For a nonexplosive Markov chain on a countable state space, this is equivalent to the existence of a stationary distribution on its irreducible class. For continuous time, a return cycle includes departure and return, rather than counting immediate residence as a return.
Pre-cutoff for Markov chains Created 2026-09-28 Updated 2026-11-05
A sequence of finite irreducible Markov chains exhibits pre-cutoff if there are constants and times such that its worst-case total variation distance satisfies
This only bounds the transition between two fixed multiples of a scale; cutoff requires the transition window to be negligible relative to the mixing scale.
For reversible aperiodic chains with , pre-cutoff implies the product condition . In fact the analogous Absolute relaxation time must be negligible too. To see the mechanism, the two distance limits make comparable to . If is the largest nontrivial eigenvalue modulus, the Eigenvalue lower bound for total variation mixing gives . The limit at forces , which implies when . The ordinary spectral gap is at least , giving the ordinary product condition.
The diverging-scale hypothesis matters. Nonlazy simple random walk on the complete graph has and , so the displayed pre-cutoff convention holds on the bounded scale , but its Relaxation time is not negligible relative to its mixing time.
Preservation under enlargement of transition support Created 2026-09-24 Updated 2026-11-05
Suppose two finite Markov chains on the same state space have transition matrices satisfying
Every positive-probability path and return cycle for is also possible for . Thus irreducibility passes from to . For a state aperiodic under , its positive return lengths under contain those under , so their greatest common divisor is still one. Hence aperiodicity also passes to .
Individual-state recurrence need not be preserved when the original chain is reducible. For example, take on and
State zero is recurrent under but transient under : once the chain leaves it, it never returns. The added transition opens an escape from its former closed class. If is finite and irreducible, however, then is also finite and irreducible, so every state remains positive recurrent. Mean recurrence times can still change because the Stationary distribution depends on transition probabilities, not merely on their support.
An invariant distribution of a continuous-time Markov chain whose coordinates are independent Poisson distributions. This property needs verification from the reaction propensity functions; it does not follow merely from having an equilibrium for the deterministic reaction-rate equations.
For example, consider the cyclic chemical reaction network with stoichiometric vectors , and and respective reaction propensity functions , , , where all three constants are positive. Put and . For , the three incoming terms in the chemical master equation are respectively , and . They exactly cancel the outgoing terms. Boundary terms vanish by the zero negative-index convention, and normalization follows from the two Poisson distributions. Establishing a limiting probability distribution additionally requires nonexplosion, an irreducible Markov chain and positive recurrence.
An irreducible Markov chain is recurrent exactly when every nonnegative superharmonic function for a Markov chain is constant. In the recurrent case, absorb the chain at . The inequality and almost-sure hitting give ; exchange . In the transient case, the hitting probability of a state is one there and satisfies the superharmonic inequality, but its one-step average at is the strictly smaller return Probability. It is a nonconstant example.
Recurrence equivalence for a CTMC and its fixed-time skeleton Created 2026-09-24 Updated 2026-11-05
For , the fixed-time skeleton has matrix . If is the holding rate, then for ,
Thus diverges exactly when does, proving recurrence equivalence for an irreducible chain.
Recurrence survives deletion of self-transitions Created 2026-10-14 Updated 2026-11-05
An irreducible recurrent discrete-time Markov chain with at least two states has everywhere. Removing repeated consecutive states from a positive-probability path proves irreducibility of its discrete-time jump chain. Each sojourn in a state is almost surely finite; infinitely many visits to a recurrent state therefore correspond to infinitely many distinct returning sojourns. The jump chain remains recurrent, although deleting holding times may change periodicity.
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 lazy walk with doubled endpoint transitions Created 2026-10-31 Updated 2026-11-05
On the finite path , take interior neighbor probabilities , endpoint inward Probability , and holding Probability , with . Detailed balance gives the displayed invariant distribution: endpoint weights are half the interior weights. For the chain is irreducible and aperiodic, so transition probabilities converge to it. At parity alternates and the period is two.
For , consider the Markov chain on the nonnegative integers with the displayed transition probabilities. From zero it starts a new upward run; from each positive state it either increments or resets. Writing , its stationary distribution is
The balance equations give and for ; the geometric series normalizes the result, and the zero-state equation agrees. It is an irreducible Markov chain and is positive recurrent. Equivalently, its first return time to zero is one plus a geometric random variable with success probability , so its mean recurrence time is . Return paths of lengths two and three also make it aperiodic.
Sequential normal predictive monitoring Created 2026-10-14 Updated 2026-11-05
For repeated independent measurements with prior and known scales, normal-normal conjugacy gives and . The next measurement has posterior predictive distribution . Its one-sided conditional posterior-predictive false-alarm level yields the displayed limit; this is a per-measurement probability, not a simultaneous false-alarm guarantee across repeated monitoring. Predictive width tends to the irreducible measurement width, while the center adapts to the individual's data. To assess a held-out measurement, fit with earlier measurements only.
Spectral kernel expansion of a reversible chain Created 2026-10-06 Updated 2026-11-05
For a finite irreducible Markov chain satisfying detailed balance with , its transition matrix is a self-adjoint operator for . For a real orthonormal eigenbasis with eigenvalues ,
Indeed, apply the spectral decomposition of to the function , whose coefficient against is . For , every eigenvalue multiplier is interpreted as one.
Spectral profile Created 2026-09-24 Updated 2026-11-05
The Spectral profile records the energy needed to concentrate a function on sets of a given stationary mass. For a finite irreducible Reversible Markov chain with Stationary distribution , define
Here is its Dirichlet form of a Markov chain, and ensures that admissible nonempty sets exist. This is the variance-normalized convention.[ref]
The profile is nonincreasing in , because enlarging permits more supports. The ordinary spectral gap is a lower bound on every , but small supports can force a larger Rayleigh quotient. For the symmetric two-state chain with off-diagonal Transition probability , a function supported on one state has energy and variance , so .
The denominator matters. Replacing variance by gives a restricted Dirichlet eigenvalue instead. On a support of mass at most , the Cauchy-Schwarz inequality gives , relating the two conventions within a factor .
Stationary cycle occupation formula Created 2026-09-24 Updated 2026-11-05
For an irreducible positive recurrent Discrete-time Markov chain with Stationary distribution , fix a state and its positive first return . The Stationary cycle occupation formula is
The cycle includes the initial visit to and excludes the returning visit. Thus for the left side is exactly one, consistent with the ratio.
Successive return cycles are independent with the same law by the Strong Markov property. The renewal reward ratio gives the long-run visit fraction as expected cycle occupation divided by expected cycle length. Kac's lemma supplies , so the ergodic visit fraction gives the displayed identity. positive recurrence ensures the cycle length and all its occupation rewards are integrable.
For distinct , the Two-state excursion visit law gives the same expected occupation as , where and . Consequently
This identity does not require reversibility: it follows from return-cycle occupation. It also does not require aperiodicity, since time averages still converge in a periodic positive recurrent chain.