The stationary distribution of an interesting Markov chain

DOI10.2307/3212655zbMath0227.60036OpenAlexW1998602421MaRDI QIDQ5634676

W. J. Hendricks

Publication date: 1972

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3212655

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Distribution theory (60E99)

Related Items

Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Fair service for mice in the presence of elephants ⋮ On the distribution of the search cost for the move-to-front rule with random weights ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Random motion on finite rings. I: commutative rings ⋮ Mixing time for Markov chain on linear extensions ⋮ Markov Chains for Promotion Operators ⋮ A generalized counter scheme ⋮ Random shuffles on trees using extended promotion ⋮ Unified theory for finite Markov chains ⋮ Limits and rates of convergence for the distribution of search cost under the move-to-front rule ⋮ Generalizations of an expansion formula for top to random shuffles ⋮ A new class of libraries ⋮ Combinatorial Markov chains on linear extensions ⋮ Stochastic ranking process with time dependent intensities ⋮ Analysis of storage hierarchy ⋮ Properties of the promotion Markov chain on linear extensions ⋮ Unnamed Item ⋮ The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ Markov chains, ${\mathscr R}$-trivial monoids and representation theory ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM ⋮ Perron eigenvector of the Tsetlin matrix