COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
The oriented swap processAdd 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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsEurope Research Seminar Series Arrol Adam Lectures - 'Responses to the First World War' Cambridge Energy ForumOther talksLunchtime Talk: Helen's Bedroom Rather more than Thirty-Nine Steps: the life of John Buchan Number, probability and community: the Duckworth-Lewis-Stern data model, Monte Carlo simulations and counterfactual futures in cricket How to make good scientific figures From dry to wet granular media Animal Migration “Modulating Tregs in Cancer and Autoimmunity” Coatable photovoltaics (Title t o be confirmed) Computing knot Floer homology Adaptation in log-concave density estimation |