Card shuffling and Diophantine approximation - PowerPoint PPT Presentation

1 / 19
About This Presentation
Title:

Card shuffling and Diophantine approximation

Description:

Generalization of Rudvalis shuffle ... overlapping cycles shuffle. Mixing time of shuffle is hard to compute, don't know the answer (open problem) ... – PowerPoint PPT presentation

Number of Views:144
Avg rating:3.0/5.0
Slides: 20
Provided by: dbwi6
Category:

less

Transcript and Presenter's Notes

Title: Card shuffling and Diophantine approximation


1
Card shuffling and Diophantine approximation
  • Omer Angel, Yuval Peres, David Wilson

Annals of Applied Probability, to appear
2
Overlapping cycles shuffle
  • Deck of n cards
  • Flip a coin to pick either nth card (bottom card)
    or (n-k)th card, move it to top of deck
  • In permutation cycle notation apply one of the
    following two permutations, probability ½ each
  • (1,2,3,4,,n)
  • (1,2,3,4,,n-k)(n-k1)(n)

3
Overlapping cycles shuffle k1
  • Pick bottom card or second from bottom card, move
    it to the top
  • Called Rudvalis shuffle
  • Takes O(n3 log n) time to mix Hildebrand
    Diaconis Saloff-Coste
  • Takes ?(n3 log n) time to mix Wilson (with
    constant 1/(8 ?2))

4
Generalization of Rudvalis shuffle
  • Pick any of k bottom cards, move to top
    ?(n3/k2 log n) mixing time Goel, Jonasson
  • Pick either bottom card, or kth card from bottom,
    move to top (overlapping cycles shuffle)
    Jonasson
  • ?(n3/k2 log n) mixing time, no matching upper
    bound
  • For kn/2, ?(n2) mixing time
  • For typical k, ?(n log n) ???

5
Mixing time ofoverlapping cycles shuffle
  • Mixing time of shuffle is hard to compute, dont
    know the answer (open problem)
  • Settle for modest goal of understanding the
    mixing of a single card
  • Perhaps mixing time of whole permutation is O(log
    n) times bigger?

6
Relaxation timefor single card
7
Markov chain for single card
  • Xt position of card at time t

By time T, card was at n-k about T/n times
card was gtn-k about T k/n times
8
(No Transcript)
9
(No Transcript)
10
Relaxation time of card
n1000
n200
Spikes at simple rationals
11
Relaxation time for simple rational k/n
12
Spectral gap for large n as k varies
13
Bells have width n3/4 Spectral gap when k/n
near simple rational
14
Spectral gap and bell ensemble
Thm. Relaxation time is max of all possible bells
15
Eigenvalues for single card
Jonasson
16
Eigenvalues of single card in overlapping cycles
shuffle
n50 k20
17
Eigenvalues for single card
18
(No Transcript)
19
Further reading
  • http//arxiv.org/abs/0707.2994
Write a Comment
User Comments (0)
About PowerShow.com