Summary
We establish necessary and sufficient condition of positive recurrence for a large class of Markov chains on permutations known as mixed libraries. This condition takes into account both geometrical and probabilistic properties of these chains.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arnaud, J.P.: Sur quelques propriétés des librairies. Thèse de spécialité. Université Paul Sabatier. Toulouse (1977)
Hendricks, W.J.: An extension of a theorem concerning an interesting Markov chain. J. Appl. Probability 10, 886–890 (1973)
Hendricks, W.J.: An account of self organizing systems. Siam J. Comput. 5, 715–723 (1976)
Kemeny, Snell and Knapp: Denumerable Markov chains. Princeton: Van Nostrand (1967)
Letac, G.: Transience and recurrence of an interesting Markov chain. J. Appl. Probability 11, 818–824 (1974)
Letac, G.: Librairies. Rapport technique du C.R.M. Université de Montréal, n∘ 569 (1975)
Letac, G.: Chaînes de Markov sur les permutations. S.M.S. Presses de l'Université de Montréal 1978
McCabe, J.: On serial files with relocatable records. Operations Researchs. 13, 607–618 (1965)
Nelson, P.R.: Library type Markov chains. Doc. Diss. Case Western University. Cleveland (1975)
Nelson, P.R.: Single shelf library type Markov chains with infinitely many books. J. Appl. Probability 14, 298–308 (1977)
Rivest, R.L.: On self-organizing sequential search heuristics. Comm. ACM. 19, 63–67 (1976)
Tsetlin, M.L.: Finite automata and models of simple form of behavior. Russian Math. Surveys. 18, 1–28 (1963)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dies, JE. Récurrence positive des librairies mixtes. Z. Wahrscheinlichkeitstheorie verw Gebiete 58, 509–528 (1981). https://doi.org/10.1007/BF00534945
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00534945