BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:TCM Journal Club
SUMMARY:How Many Shuffles to Randomize a Deck of Cards? - 
 Richard Brierley (TCM)
DTSTART;TZID=Europe/London:20090116T160000
DTEND;TZID=Europe/London:20090116T163000
UID:TALK16254AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/16254
DESCRIPTION:"Proc. Roy. Soc. 456\, 2561 (2000) L. N. Trefethen
  and L. M. Trefethen":http://journals.royalsociety
 .org/content/hj18bd3a1kntx189/\n\nA celebrated the
 orem of Aldous\, Bayer and Diaconis asserts that i
 t takes ~3/2 log2 n riffle shuffles to randomize a
  deck of n cards\, asymptotically as n M X\, and t
 hat the randomization occurs abruptly according to
  a 'cut-off phenomenon'. These results depend upon
  measuring randomness by a quantity known as the t
 otal variation distance. If randomness is measured
  by uncertainty or entropy in the sense of informa
 tion theory\, the behaviour is different. It takes
  only ~ log2 n shuffles to reduce the information 
 to a proportion arbitrarily close to zero\, and ~ 
 3/2 log2 n to reduce it to an arbitrarily small nu
 mber of bits. At 3/2> log2 n shuffles\, ca.0.0601 
 bits remain\, independently of n.
LOCATION:TCM Seminar Room\, Cavendish Laboratory
CONTACT:Daniel Cole
END:VEVENT
END:VCALENDAR