Stationary distribution of an M-M-s-K queue Created 2026-10-03 Updated 2026-11-05
Put . The unique Stationary distribution of an queue is
where is the sum of the displayed weights. Adjacent terms satisfy detailed balance for a birth-death process, so the queue is reversible in equilibrium.
In a one-operator closed migration process representing a finite-line switchboard, let count calls waiting for or receiving the operator's connection service and let count connected calls. At a stationary distribution, the expected drift of is , and that of is . Poisson arrivals see time averages identifies the full-state probability with . Thus the accepted arrival rate, operator throughput and completed-call rate coincide. This is a useful independent check on the product-form stationary distribution of a closed migration process.
Stationary jump traffic at a single contact Created 2026-10-25 Updated 2026-11-05
Use the master-equation convention that is the transition rate from to . In a stationary law , the mean directed transition count per unit time is
The departure-state occupation multiplies the departure-to-destination rate. The reversed rate index would describe a different transition. A physical event transporting signed charge in the forward direction has mean charge current .[ref]
For a closed finite chain whose complete transition graph is a tree, every stationary edge current is zero. Removing one edge separates the states into two sets; stationarity makes total probability flow across that cut vanish, and the removed edge is its only crossing. Both directed counts can nevertheless be positive. On a three-state path with symmetric adjacent rates , the stationary law is uniform and the two edge traffic rates are and in each direction.
Different physical transition mechanisms between the same states should be kept as separate edges of a multigraph when their currents matter. Summing their rates produces an aggregated edge. Opposing mechanism currents can cancel in that aggregate, so zero aggregate current does not force every mechanism's current to vanish.
On states , take an interior step of or with probability each and hold with probability . At an endpoint take the inward step with probability and hold with probability . For and , the chain is irreducible and its stationary distribution has endpoint weights and interior weights .
Detailed balance proves this: the doubled inward endpoint transition requires its stationary mass to be half that of an adjacent interior point, and all interior points have equal mass. The total unnormalized weight is . For there are just two equal endpoint masses.
When , positive self-loops make the chain aperiodic, so its transition probabilities converge to this law. At every move changes parity and two-step returns are possible, giving period two and no such convergence from a fixed starting state. At every state is absorbing and uniqueness of the stationary law is lost.
For route offered loads , the balance function of a flow-level network gives the stationary distribution
The negative binomial series sums over , and two geometric sums give under the stability conditions for a two-resource linear flow network.
Stationary-reset perturbation of a Markov chain Created 2026-09-28 Updated 2026-11-05
Let be a transition matrix with Stationary distribution , and let have every row equal to . For , the stationary-reset perturbation
follows the original transition with Probability and independently resamples from stationarity with Probability . Since and ,
The total variation identity is exact: subtracting stationarity multiplies every signed row difference by the same nonnegative factor. Once the first reset occurs the distribution remains stationary, so the factor also has a direct no-reset Probability interpretation.
This can destroy pre-cutoff. Take the dimension- Shift-refresh chain on a hypercube, whose distance is for and zero for . Use reset Probability for fixed and . For , , while at the distance is zero. A positive fraction of the mixing scale therefore already causes a nonvanishing decrease from one. Any scale capable of making the later distance tend to zero must be at least order , and its earlier fixed positive multiple cannot have distance tending to one. Thus this perturbed family lacks pre-cutoff even though the original has a sharp cutoff.
Stationary weights of a reflected birth-death chain Created 2026-10-25 Updated 2026-11-05
Consider an irreducible Markov chain on the nonnegative integers with up-step probabilities and down-step probabilities for , reflected at zero. The displayed weights satisfy detailed balance. Every stationary distribution is proportional to them: the stationary equation at zero sets the edge flow to zero, and the remaining stationary equations make the flow constant along all edges. Hence positive recurrence is equivalent to , and then . This also allows holding probabilities of a Markov chain.
A steady state does not by itself give every fluctuating observable an entropy production symmetry. If the dimensionless total entropy production has the same-law finite relation and a large deviation principle with rate function for , then, on its common domain,
The first expression denotes leading exponential scaling; the second follows by taking the scaled logarithm of the probability ratio. A finite-state, autonomous Markov process with time-even states, positive bidirectional rates and a positive stationary distribution supplies a standard setting for a finite total-entropy production relation. The stochastic system entropy is then bounded, so its endpoint contribution does not change the long-time rate function of bath entropy production. [ref]
Unbounded state spaces can have endpoint fluctuations on the scale relevant to a large deviation principle. Dropping system entropy, changing the measured observable to heat, or changing the reverse preparation therefore requires a fresh argument. The exact finite integral fluctuation theorem, a same-law finite relation, and an asymptotic rate function symmetry are distinct claims.
Strong stationary time Created 2026-09-24 Updated 2026-11-05
A randomized stopping time is a strong stationary time for a Markov chain with stationary distribution when has distribution and is independent of . Equivalently,
Drive two copies of a random affine recursion with the same coefficient pairs, independent of their initial coupling. Then . If and , independence of random variables gives
This proves convergence in L1 and hence convergence in probability of the difference. If one copy starts in a stationary distribution, Slutsky's theorem shows that the other copy converges to that distribution. The argument compares paths before taking their one-time probability distributions; it does not require the paths ever to become exactly equal.
The terminal model of copolymerization represents a growing copolymer chain's addition kinetics using only the identity of its final monomeric unit. For two incoming monomers, there are two end types and four chain-growth propagation rate constants , where identifies the existing end and the incoming monomer. Earlier sequence history is omitted from this kinetic state description.[ref]
At a fixed reacting-mixture composition, addition rates give a two-state Markov chain. With the monomer mole fractions and , the monomer reactivity ratios, its transition matrix is
Rows label the current terminal unit; columns label the newly added unit. Each row sums to one. This interprets a sequence at fixed feed and neglects initiation, termination and feed drift over the sampled run.
For an original example, take and . Then and both cross-addition probabilities are . The stationary distribution is , so the long-chain mean composition is equimolar, while equal consecutive units are favored. A run of type 1 has a geometric distribution with stopping probability and mean length 3. Independent equimolar placement would instead give mean run length 2. Mean composition alone does not determine sequence correlations.
The copolymer composition equation concerns the instantaneous incorporated composition implied by this model. Applying it over a finite conversion interval requires following changes in the reacting mixture. The IUPAC recommendation explicitly bases ratio estimation on conversion and composition observations at different starting feeds.[ref]
Historically, Frank R. Mayo and Frederick M. Lewis published a 1944 theoretical comparison of monomers with a study of styrene and methyl methacrylate.[ref] A successful terminal-model fit is evidence about a chosen kinetic representation, not proof that every chemical influence vanishes beyond the last unit.
Suppose annual claim counts are independent with geometric distribution mass , . In a no claims discount system with discounts , a claim returns either of the first two levels to zero; at the top, one claim sends the level to and two or more send it to zero. The transition matrix is . Solving gives the displayed stationary distribution. With full premium , the stationary expected value of the premium is . Independent annual sampling is essential; a persistent random intensity does not justify this marginal transition matrix.
Three-level no claims discount equilibrium Created 2026-10-14 Updated 2026-11-05
For a three-level birth-death chain whose down-or-stay claim probabilities are , with each in , detailed balance is and . Normalizing gives the displayed stationary distribution. The finite chain is irreducible and has endpoint holding probabilities, so it is aperiodic and its level proportions converge to this distribution from any initial level.
Time-reversed Markov chain Created 2026-09-29 Updated 2026-11-05
For a stationary Markov chain with transition matrix and Stationary distribution , the time-reversed Markov chain has transition matrix
on the support . The Stationary distribution is essential: Bayes' rule gives . The quotient is not defined at a zero-mass state, so arbitrary states outside the stationary support must not be included without an extra convention.
The stationarity equations give . Also , so the reversed kernel has the same invariant law. Multiplying the pairwise identity along a finite path proves equality between its forward Probability and the Probability of the reversed path under .
The reversed chain need not be the original chain. A directed three-state cycle has uniform Stationary distribution; time reversal traverses the cycle in the opposite direction. A stationary chain is reversible exactly when , which is equivalent to Detailed balance.
Top-to-random card shuffle Created 2026-10-03 Updated 2026-11-05
The Top-to-random card shuffle removes the top card and inserts it in one of the positions uniformly. Its Stationary distribution is uniform on permutations. Each move is the inverse of a move of the Random-to-top card shuffle, so these chains are time reversals under that Stationary distribution.
In this group-walk setting they also have the same total variation mixing profile. Starting from the identity permutation, a random-to-top path multiplies independent identically distributed increments . The top-to-random increments have their inverse law. Reversing the order of an iid list leaves its joint law unchanged, so the product of inverse increments has the law of . Inversion is a bijection preserving the uniform distribution; it therefore preserves total variation distance to that distribution. Translation symmetry makes the distance independent of the starting permutation.
Consequently top-to-random shares the cutoff scale and order- window of random-to-top. The group symmetry is essential to this argument: time reversal alone does not give equality of worst-case total variation profiles for arbitrary Markov chains.
Take states for , with deterministic and transitions with probability , with probability , with probability , and with probability . The Markov chain is transient for , null recurrent for , and positive recurrent for . To see the Markov chain recurrence threshold, eliminate the primed-state hitting probabilities to obtain , with characteristic roots and . Boundedness forces return with probability one when the second root is at least one. When it is below one, the minimal nonnegative solution gives return probability from . In the positive recurrent case, put and . The stationary distribution is , and . It follows from balance across each level cut and sums to one; at criticality the invariant weights cannot be normalized.
A two-phase inspection model alternates between inspecting every item and inspecting each item with probability , where . Suppose item defects are independent with probability . The first phase ends after good items have been accumulated, while the second ends upon detecting a defect. With state equal to the cumulative number of good items found during the current full-inspection phase, the Markov chain has transitions , , , .
Its stationary distribution is for and . Indeed, balance gives equal mass to every phase-A state and ; normalization fixes the common mass. The finite chain is irreducible and aperiodic, so the Markov chain ergodic theorem identifies these probabilities with long-run occupation fractions. The long-run inspected fraction is . The fraction of all production consisting of undetected defective items is .
An important modeling choice is whether defects during full inspection preserve accumulated good items or reset the count. Resetting produces the distinct consecutive-clearance inspection model and changes the long-run fractions.
Refill the stock to a fixed positive size immediately whenever a step empties it. The resulting Markov chain has state space and transitions for and . It is irreducible and aperiodic, since every state reaches , reaches every state, and . Its unique stationary distribution is and for . Normalization is the harmonic number identity. For , stationarity follows from ; the same telescoping sum starting at gives stationarity at . The finite-state convergence theorem therefore makes this stationary distribution the limiting distribution from every initial state.
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.
Wasserstein contraction Created 2026-09-24 Updated 2026-11-05
A Markov kernel has Wasserstein contraction factor for a ground metric when
for all probability measures for which the distances are finite. Writing gives a positive one-step contraction rate . Iteration yields . If is a stationary distribution with finite first moment, this proves geometric convergence in Wasserstein distance to and uniqueness within that moment class. A continuous-time version instead uses factor for its transition semigroup.
For the random affine recursion on the real line with and independent finite-first-moment noise, Synchronous coupling uses the same fresh for both chains. It gives , hence the contraction factor for . The stationary random series converges absolutely almost surely because its expected absolute sum is finite. Thus this example also supplies existence, which a uniqueness argument alone would not establish.