University of Cambridge > Talks.cam > Probability > The oriented swap process

The oriented swap process

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

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

The oriented swap process is a random walk on the symmetric group of order N. Starting from the identity permutation, at each step an adjacent swap is chosen uniformly and applied to the current permutation, but only if it increases the number of inversions. Eventually the walk terminates when it reaches the permutation with maximal number of inversions. In recent work with Omer Angel and Alexander Holroyd, we analyzed the asymptotic behavior of the oriented swap process when N tends to infinity using the theory of totally asymmetric exclusion processes, deriving formulas for the limiting trajectories of individual numbers (“particles”) in the permutation and for the flow of particles en masse. An interesting connection to random matrix theory also makes an appearance. I will explain these results and show computer simulations.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity