scientific article; zbMATH DE number 903457

DOI<179::AID-RSA2>3.0.CO;2-V 10.1002/(SICI)1098-2418(199605)8:3<179::AID-RSA2>3.0.CO;2-VzbMath0852.60089MaRDI QIDQ4885223

James Allen Fill, Lars Holst

Publication date: 8 December 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stationary distributionstochastic orderingSchur-concavity

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

On the distribution of the search cost for the move-to-front rule with random weights, A Transposition Rule Analysis Based on a Particle Process, Cache Miss Estimation for Non-Stationary Request Processes, Limiting behavior of the search cost distribution for the move-to-front rule in the stable case, A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements, Limits and rates of convergence for the distribution of search cost under the move-to-front rule, Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process, Limiting search cost distribution for the move-to-front rule with random request probabilities, The limiting move-to-front search-cost in law of large numbers asymptotic regimes, Stochastic ranking process with time dependent intensities, Least-recently-used caching with dependent requests, Critical sizing of LRU caches with dependent requests, Unnamed Item, A fluid limit for a cache algorithm with general request processes, Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement, 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