Título: Mixing Time of the Rudvalis Shuffle
Autores: Wilson, David Bruce; Microsoft Research
Fecha: 2003-01-01
Publicador: Electronic communications in probability
Fuente:
Tipo: Peer-reviewed Article

Tema: Markov chain, card shuffling, mixing time
60J10, 60C05
Descripción: We extend a technique for lower-bounding the mixing time of card-shuffling Markov chains, and use it to bound the mixing time of the Rudvalis Markov chain, as well as two variants considered by Diaconis and Saloff-Coste. We show that in each case $\Theta(n^3 \log n)$ shuffles are required for the permutation to randomize, which matches (up to constants) previously known upper bounds. In contrast, for the two variants, the mixing time of an individual card is only $\Theta(n^2)$ shuffles.
Idioma: No aplica

Artículos similares:

Simulations and Conjectures for Disconnection Exponents por Puckette, Emily E.; Occidental College,Werner, Wendelin; Université Paris-Sud and IUF
A Proof of a Conjecture of Bobkov and Houdré por Kwapien, S.; Warsaw University,Pycia, M.; Warsaw University,Schachermayer, W.; University of Vienna
Excursions Into a New Duality Relation for Diffusion Processes por Jansons, Kalvis M.; University College London
Moderate Deviations for Martingales with Bounded Jumps por Dembo, Amir; Stanford University
Percolation Beyond $Z^d$, Many Questions And a Few Answers por Benjamini, Itai; Weizmann Institute of Science,Schramm, Oded; Microsoft Research
Bounds for Disconnection Exponents por Werner, Wendelin; Université Paris-Sud and IUF
Transportation Approach to Some Concentration Inequalities in Product Spaces por Dembo, Amir; Stanford University,Zeitouni, Ofer; Technion - Israel Institute of Technology
The Dimension of the Frontier of Planar Brownian Motion por Lawler, Gregory F.; Duke University
10 
Surface Stretching for Ornstein Uhlenbeck Velocity Fields por Carmona, Rene; Princeton University,Grishin, Stanislav; Princeton University,Xu, Lin; Princeton University,Molchanov, Stanislav; University of North Carolina at Charlotte