BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Partial shuffles by lazy swaps - Robert Johnstone (QMUL)
DTSTART:20230504T133000Z
DTEND:20230504T143000Z
UID:TALK200539@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:Suppose we generate a random permutation using\na sequence of 
 random swaps -- that is\, we perform a sequence of moves each\nof which in
 volves swapping a pair of elements in given positions with given\nprobabil
 ity.\n\nHow many such moves are needed to make sure that at the end we hav
 e a\nuniformly random permutation? What if we just require that every elem
 ent is\nequally likely to be in any position? And what if we insist that e
 very\npair\, or just a single fixed pair\, of elements is uniformly distri
 buted?\n\nI will discuss some problems and results on these questions and 
 related\nones.\n\nJoint work with Barnabás Janzer and Imre Leader.
LOCATION:MR12
END:VEVENT
END:VCALENDAR