Shuffling Cards and Stopping Times 论文

1986American Mathematical Monthly引用 346
Algorithms and Data CompressionMathematics and ApplicationsAdvanced Combinatorial Mathematics

摘要

1. Introduction. How many times must a deck of cards be shuffled until it is close to random? There is an elementary technique which often yields sharp estimates in such problems. The method is best understood through a simple example. EXAMPLE1. Top in at random shuffle. Consider the following method of mixing a deck of cards: the top card is removed and inserted into the deck at a random position. This procedure is

相关事件

暂无数据

相关文章

暂无数据