An extension of a theorem concerning an interesting Markov chain

DOI10.2307/3212392zbMath0271.60079OpenAlexW2005915661MaRDI QIDQ5179612

W. J. Hendricks

Publication date: 1973

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

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

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (15)

Upper Bounds on Mixing Time of Finite Markov Chains ⋮ A competitive analysis of the list update problem with lookahead ⋮ Mixing time for Markov chain on linear extensions ⋮ Markov Chains for Promotion Operators ⋮ A generalized counter scheme ⋮ Deterministic optimal and expedient move-to-rear list organizing strategies ⋮ Random shuffles on trees using extended promotion ⋮ Unified theory for finite Markov chains ⋮ A new class of libraries ⋮ Combinatorial Markov chains on linear extensions ⋮ Properties of the promotion Markov chain on linear extensions ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3908273 R�currence positive des librairies mixtes] ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ On lookahead in the list update problem ⋮ Perron eigenvector of the Tsetlin matrix

This page was built for publication: An extension of a theorem concerning an interesting Markov chain