A Mixing Time Bound for the Diaconis Shuffle

A Mixing Time Bound for the Diaconis Shuffle - eScholarship

Author(s): Senda, Alto Eugene | Advisor(s): Morris, Ben | Abstract: We prove a theorem that reduces bounding the mixing time of a card shuffle to verifying ...

A lower bound for the mixing time of the random-to ... - Project Euclid

The best known lower and upper bounds on the mixing time for the random to-random insertions shuffle are ... In particular, Diaconis conjectured that the cutoff ...

[2411.06006] Mixing time of the torus shuffle - arXiv

Then we use it to analyze a classic model of card shuffling. In 1988, Diaconis introduced the following Markov chain. Cards are arranged in an n ...

Markov chain mixing time - Wikipedia

Tools for proving rapid mixing include arguments based on conductance and the method of coupling. ... Diaconis, Persi (1992), "Trailing the dovetail shuffle to ...

[math/0210469] Mixing Time of the Rudvalis Shuffle - arXiv

... 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 ...

Shuffling - Dartmouth College Mathematics

Now, we know the exact mixing time of the Riffle shuffle and it also gives us a bound on ... Diaconis (1986), Shuffling Cards and Stopping Times.

Mixing time of the card-cyclic-to-random shuffle - Project Euclid

In a classical result of Diaconis and Shahshahani [4], the mixing time ... A lower bound for the mixing time of the random-to-random insertions shuffle ...

Shuffling Cards and Stopping Times - Open Access Labs (OAL)

Here is a basic upper bound lemma which relates strong uniform times to the distance between ... Diaconis, Uniform stopping times for random walks on groups, 1985 ...

Mixing Times of Markov Chains: Techniques and Examples

representation theory and the Diaconis–Shahshahani upper bound lemma, as well as analytic methods based on functional inequalities such as ...

Improved Mixing Time Bounds for the Thorp Shuffle and L-Reversal ...

We obtain a mixing time bound of O (log4 n). Previously, the best known ... and DIACONIS, P. (1992). Trailing the dovetail shuffle to its lair. Ann ...

A lower bound for the mixing time of the random-to-random ... - EMIS

A lower bound for the mixing time of the random-to-random Insertions shuffle. ... Diaconis, P.; Saloff-Coste, L. Random walks on finite groups: a ...

The mixing time of the thorp shuffle - ACM Digital Library

Bayer, D. and Diaconis, P. Tracing the dovetail shuffle to its lair, Annals of Applied Probability. 2 (1992). pp. 294--313.

Mixing Time Estimates for the Riffle Shuffle 1 Motivation 2 Introduction

6 Probabilities of reaching a specific permutation. A generalization of the standard riffle shuffle to a-shuffles is introduced by Bayer-Diaconis. Definition ...

Markov Chains and Mixing Times David A. Levin Yuval Peres ...

... Bound. 163 ... At the same time, mathematicians including Aldous and Diaconis were inten- sively studying card shuffling and other random walks on groups.

Mixing times for neighbour transposition shuffles on graphs

The random transpositions shuffle was treated by Diaconis and Shahshahani in [8]. ... will be used also to bound the mixing time on random graphs from above, in ...

Markov Chains and Mixing Times, second edition David A. Levin ...

A bound for cover times ... At the same time, mathematicians including Aldous and Diaconis were inten- sively studying card shuffling and other random walks on ...

Coupling & Strong Stationary Time 5.1 Top-to-Random Shuffling

Now, we study the mixing time of the inverse riffle shuffle. We design a strong stationary time. The idea is due to Aldous and Diaconis [AD86]. Suppose we have ...

Markov Chains and Mixing Times - American Mathematical Society

At the same time, mathematicians including Aldous and Diaconis were inten- ... Improved mixing time bounds for the Thorp shuffle and L-reversals, available.

Persi Diaconis - Algebraic Statistics for Computational Biology

There is a mathematical reason that allows riffle shuffles to be analyzed so completely. The basic shuffling model falls squarely into Solomon's descent algebra.

Mathematical Aspects of Mixing Times in Markov Chains

the first polynomial bound in d on the mixing time of this shuffle for a. 2d ... Diaconis and Saloff-Coste improve the lower bound slightly to ρ ≥. (1 ...