Abstract
This paper initiates a limit theory of permutation valued processes, building on the recent theory of permutons. We apply this to study the asymptotic behaviour of random sorting networks. We prove that the Archimedean path, the conjectured limit of random sorting networks, is the unique path from the identity to the reverse permuton having minimal energy in an appropriate metric. Together with a recent large deviations result (Kotowski, 2016), it implies the Archimedean limit for the model of relaxed random sorting networks.
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
O. Angel, D. Dauvergne, A. E. Holroyd and B. Virág: The local limit of random sorting networks, to appear in Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, arXiv:1702.08368.
O. Angel, V. Gorin and A. E. Holroyd: A pattern theorem for random sorting networks, Electronic Journal of Probability 17 (2012), 1–16.
O. Angel, A. E. Holroyd, D. Romik and B. Virág: Random sorting networks, Advances in Mathematics 215 (2007), 839–868.
D. Dauvergne: The Archimedean limit of random sorting networks, Preprint, 2018, arXiv:1802.08934.
D. Dauvergne and B. Virág: Circular support in random sorting networks, Preprint, 2018, arXiv:1802.08933.
P. Edelman and C. Greene: Balanced tableaux, Advances in Mathematics 63 (1987), 42–99.
R. Glebov, A. Grzesik, T. Klimošová and D. Král: Finitely forcible graphons and permutons, Journal of Combinatorial Theory, Series B. 110 (2015), 112–135.
V. Gorin and M. Rahman: Random sorting networks: Local statistics via random matrix laws, Preprint, 2017, arXiv:1702.07895.
C. Hoppen, Y. Kohayakawa, C. G. Moreira, B. Rath and R. M. Sampaio: Limits of permutation sequences, Journal of Combinatorial Theory, Series B. 102 (2013), 93–113.
O. Kallenberg: Foundations of Modern Probability, Springer-Verlag New York, 2nd edition, 2002.
R. Kenyon, D. Král, C. Radin and P. Winkler: Permutations with fixed pattern densities, Preprint, 2015, arXiv:1506.02340.
M. Kotowski: Limits of random permuton processes and large deviations of the interchange process, PhD Thesis, University of Toronto, 2016.
M. Rahman and B. Virág: Brownian motion as limit of the interchange process, Preprint, 2016, arXiv:1609.07745.
L. Rüschendorf: On the distributional transform, Sklar’s theorem and the empirical copula process, Journal of Statistical Planning and Inference 139 (2009), 3921–3927.
R. P. Stanley: On the number of reduced decompositions of elements of Coxeter groups, European Journal of Combinatorics 5 (1984), 359–372.
S. Starr: Thermodynamic limit for the Mallows model on S n, Journal of Mathematical Physics 50 (2009).
Acknowledgements
M. Rahman was partially supported by an NSERC PDF award. B. Virág was supported by the Canada Research Chair program, the NSERC Discovery Accelerator grant, the MTA Momentum Random Spectra research group, and the ERC consolidator grant 648017 (Abért). M. Vizer was supported by NKFIH under the grant SNN 116095.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Rahman, M., Virág, B. & Vizer, M. Geometry of Permutation Limits. Combinatorica 39, 933–960 (2019). https://doi.org/10.1007/s00493-019-3817-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-019-3817-6