Partial shuffles by lazy swaps

Add to your list(s) Download to your calendar using vCal

• Robert Johnstone (QMUL)
• Thursday 04 May 2023, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

Suppose we generate a random permutation using a sequence of random swaps—that is, we perform a sequence of moves each of which involves swapping a pair of elements in given positions with given probability.

How many such moves are needed to make sure that at the end we have a uniformly random permutation? What if we just require that every element is equally likely to be in any position? And what if we insist that every pair, or just a single fixed pair, of elements is uniformly distributed?

I will discuss some problems and results on these questions and related ones.

Joint work with Barnabás Janzer and Imre Leader.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.