| Título: | Mixing Time Bounds for Overlapping Cycles Shuffles |
| Autores: | Jonasson, Johan; Chalmers University of Technology and Göteborg University |
| Fecha: | 2011-01-01 |
| Publicador: | Electronic journal of probability |
| Fuente: |
 |
| Tipo: |
Peer-reviewed Article |
| Tema: |
comparison technique, Wilson's technique, relative entropy 60J10 |
| Descripción: | Consider a deck of n cards. Let $p_1,p_2,\ldots,p_n$ be a probability vector and consider the mixing time of the card shuffle which at each step of time picks a position according to the pi 's and move the card in that position to the top. This setup was introduced in [5], where a few special cases were studied. In particular the case $p_{n-k}=p_n=1/2$, $k=\Theta(n)$, turned out to be challenging and only a few lower bounds were produced. These were improved in [1] where it was shown that the relaxation time for the motion of a single card is $\Theta(n^2)$ when $k/n$ approaches a rational number. In this paper we give the first upper bounds. We focus on the case $m:=n-k=\lfloor n/2\rfloor$. It is shown that for the additive symmetrization as well as the lazy version of the shuffle, the mixing time is $O(n^3\log(n))$. We then consider two other modifications of the shuffle. The first one is the case $p_{n-k}=p_{n-k+1}=1/4$ and $p_n=1/2$. Using the entropy technique developed by Morris [7], we show that mixing time is $O(n^2\log^3(n))$ for the shuffle itself as well as for the symmetrization. The second modification is a variant of the first, where the moves are made in pairs so that if the first move involves position $n$ , then the second move must be taken from positions $m$ or $m+1$ and vice versa. Interestingly, this shuffle is much slower; the mixing time is at least of order $n^3\log(n)$ and at most of order $n^3\log^3(n))$. It is also observed that results of [1] can be modified to improve lower bounds for some $k=o(n)$. |
| Idioma: | No aplica |
1 Lévy Classes and Self-Normalization por Khoshnevisan, Davar; University of Utah | 6 Time-Space Analysis of the Cluster-Formation in Interacting Diffusions por Fleischmann, Klaus; Weierstrass Institute for Applied Analysis and Stochastics,Greven, Andreas; Universitat Erlangen-Nurnberg |
2 Hausdorff Dimension of Cut Points for Brownian Motion por Lawler, Gregory F.; Duke University and Cornell University | 7 Conditional Moment Representations for Dependent Random Variables por Bryc, Wlodzimierz; University of Cincinnati |
3 Eigenvalue Expansions for Brownian Motion with an Application to Occupation Times por Bass, Richard F.; University of Washington,Burdzy, Krzysztof; University of Washington | 8 Almost Sure Exponential Stability of Neutral Differential Difference Equations with Damped Stochastic Perturbations por Liao, Xiao Xin; University of Strathclyde,Mao, Xuerong; University of Strathclyde |
4 Random Discrete Distributions Derived from Self-Similar Random Sets por Pitman, Jim; University of California, Berkeley,Yor, Marc; Université Pierre et Marie Curie | 9 Quantitative Bounds for Convergence Rates of Continuous Time Markov Processes por Roberts, Gareth O.; University of Cambridge,Rosenthal, Jeffrey S.; University of Toronto |
5 A Microscopic Model for the Burgers Equation and Longest Increasing Subsequences por Seppäläinen, Timo; Iowa State University | 10 Metastability of the Three Dimensional Ising Model on a Torus at Very Low Temperatures por Ben Arous, Gérard; Ecole Normale Supérieure,Cerf, Raphaël; Université Paris Sud |