Browsing Cornell Theses and Dissertations by Subject "Faber-Krahn Inequalities"
Now showing items 1-1 of 1
(2005-06-21)How many times do you have to shuffle a deck of n cards before it is close to random? log n? n? n^3? Similar convergence rate questions for finite Markov chains are central to solving applied problems in diverse fields ...