随机请求概率下移动到前面规则的极限搜索代价分布
Limiting search cost distribution for the move-to-front rule with random request probabilities
摘要：
考虑一个流行度随机的$n$文件列表。这些文件更新根据移动到前面的规则，我们认为诱导马尔可夫链在平衡。当$n$趋于无穷大时，我们给出了每项搜索成本的精确极限分布。提供了一些例子。
英文摘要：
Consider a list of $n$ files whose popularities are random. These files are updated according to the move-to-front rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as $n$ tends to infinity. Some examples are supplied.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
