Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the transition probabilities of the move-to-front scheme

From MaRDI portal
Publication:4305664
Jump to:navigation, search

DOI10.2307/3215049zbMath0805.60059OpenAlexW4239520565MaRDI QIDQ4305664

Ravindra M. Phatarfod

Publication date: 29 January 1995

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

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

zbMATH Keywords

Markov chainpermutationcoupon-collector's problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)


Related Items

An exact formula for the move-to-front rule for self-organizing lists, Limits and rates of convergence for the distribution of search cost under the move-to-front rule, Least-recently-used caching with dependent requests, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4305664&oldid=18245252"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 20:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki