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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

The oriented swap process

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Latimer Room, Clare College, Trinity Lane, Cambridge CB2 1TL. King's Graduate Seminar Harrods Room, Emmanuel College, St Andrew’s Street, Cambridge CB2 3AP

Other talks

Title to be confirmed Title TBC Spectral theory for Dirac operators with singular potentials Group Work Group Work The Play Paradox: How video games build better humans
 

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