Abstract
This paper finds the bulk local limit of the swap process of uniformly random sorting networks. The limit object is defined through a deterministic procedure, a local version of the Edelman–Greene algorithm, applied to a two dimensional determinantal point process with explicit kernel. The latter describes the asymptotic joint law near 0 of the eigenvalues of the corners in the antisymmetric Gaussian Unitary Ensemble. In particular, the limiting law of the first time a given swap appears in a random sorting network is identified with the limiting distribution of the closest to 0 eigenvalue in the antisymmetric GUE. Moreover, the asymptotic gap, in the bulk, between appearances of a given swap is the Gaudin–Mehta law—the limiting universal distribution for gaps between eigenvalues of real symmetric random matrices. The proofs rely on the determinantal structure and a double contour integral representation for the kernel of random Poissonized Young tableaux of arbitrary shape.
This is a preview of subscription content, access via your institution.










References
Angel, O., Gorin, V., Holroyd, A.E.: A pattern theorem for random sorting networks. Electron. J. Probab. 17(99), 1–16 (2012). arXiv:1110.0160
Angel, O., Dauvergne, D., Holroyd, A.E., Virág, B.: The local limit of random sorting networks. Ann. Inst. Henri Poincaré Probab. Stat. arXiv:1702.08368 (to appear)
Angel, O., Holroyd, A.E.: Random subnetworks of random sorting networks. Electron. J. Combin. 17, 23 (2010). arXiv:0911.2519
Angel, O., Holroyd, A., Romik, D.: The oriented swap process. Ann. Probab. 37, 1970–1998 (2009). arXiv:0806.2222
Angel, O., Holroyd, A., Romik, D., Virág, B.: Random sorting networks. Adv. Math. 215(2), 839–864 (2007). arXiv:math/0609538
Baik, J., Deift, P., Johansson, K.: On the distribution of the length of the longest increasing subsequence of random permutations. J. Am. Math. Soc. 12(4), 1119–1178 (1999). arXiv:math/9810105
Borodin, A.: Determinantal point processes. In: Oxford Handbook of Random Matrix Theory. Oxford University Press (2011). arXiv:0911.1153
Borodin, A., Gorin, V.: Lectures on integrable probability. In: Probability and Statistical Physics in St. Petersburg, Proceedings of Symposia in Pure Mathematics, vol. 91, pp. 155–214. AMS (2016). arXiv:1212.3351
Borodin, A., Okounkov, A., Olshanski, G.: Asymptotics of Plancherel measures for symmetric groups. J. Am. Math. Soc. 13, 491–515 (2000). arXiv:math/9905032
Borodin, A., Olshanski, G.: The Young bouquet and its boundary. Mosc. Math. J. 13(2), 193–232 (2013). arXiv:1110.4458
Borodin, A., Petrov, L.: Integrable probability: from representation theory to Macdonald processes. Probab. Surv. 11, 1–58 (2014). arXiv:1310.8007
Daley, D., Vere-Jones, D.: An Introduction to the Theory of Point Processes. Elementary Theory and Methods, vol. 1. Springer, New York (2003)
Dauvergne, D.: The Archimedean limit of random sorting networks, preprint (2018). arXiv:1802.08934
Dauvergne, D., Virág, B.: Circular support in random sorting networks, preprint (2018). arXiv:1802.08933
Deift, P., Its, A., Zhou, X.: The Riemann–Hilbert approach to asymptotic problems arising in the theory of random matrix models, and also in the theory of integrable statistical mechanics. Ann. Math. 146(1), 149–235 (1997)
Deift, P., Its, A., Krasovksy, I., Zhou, X.: The Widom–Dyson constant for the gap probability in random matrix theory. J. Comput. Appl. Math. 202(1), 26–47 (2007)
Defosseux, M.: Orbit measures, random matrix theory and interlaced determinantal processes. Ann. Inst. Henri Poincaré Probab. Stat. 46(1), 209–249 (2010)
Duse, E., Metcalfe, A.: Asymptotic geometry of discrete interlaced patterns: part I. Int. J. Math. 26(11) (2015). arXiv:1412.6653
des Cloiseau, J., Mehta, M.L.: Asymptotic behavior of spacing distributions for the eigenvalues of random matrices. J. Math. Phys. 14, 1648–1650 (1973)
Dyson, F.: Fredholm determinants and inverse scattering problems. Commun. Math. Phys. 47, 171–183 (1976)
Edelman, P., Greene, C.: Balanced tableaux. Adv. Math. 63(1), 42–99 (1987)
Ehrhardt, T.: Dyson’s constant in the asymptotics of the Fredholm determinant of the sine kernel. Commun. Math. Phys. 262, 317–341 (2006)
Ehrdardt, T.: Dyson’s constants in the asymptotics of the determinants of Wiener–Hopf–Hankel operators with the sine kernel. Commun. Math. Phys. 272, 683–698 (2007)
Forrester, P.J.: Log-Gases and Random Matrices. Princeton University Press, Princeton (2010)
Forrester, P.J., Nordenstam, E.: The anti-symmetric GUE minor process. Mosc. Math. J. 9(4), 749–774 (2009). arXiv:0804.3293
Garcia, A.: The saga of reduced factorizations of elements of the symmetric group. Laboratoire de combinatoire et d’informatique mathématique (2002)
Gaudin, M.: Sur la loi limite de l’espacement des valeurs propres d’une matrice aléatoire. Nucl. Phys. 25, 447–458 (1961)
Hamaker, Z., Young, B.: Relating Edelman–Greene insertion to the Little map. J. Algebraic Combin. 40(3), 693–710 (2014). arXiv:1210.7119
Johansson, K.: Discrete orthogonal polynomial ensembles and the Plancherel measure. Ann. Math. 153(2), 259–296 (2001). arXiv:math/9906120
Kotowski, M.: Limits of random permuton processes and large deviations for the interchange process. Ph.D. Thesis, University of Toronto (2016)
Krasovsky, I.V.: Gap probability in the spectrum of random matrices and asymptotics of polynomials orthogonal on an arc of the unit circle. Int. Math. Res. Not. 25, 1249–1272 (2004). arXiv:math/0401258
Lenard, A.: Correlation functions and the uniqueness of the state in classical statistical mechanics. Commun. Math. Phys. 30, 35–44 (1973)
Nica, M.: Decorated Young tableaux and the Poissonized Robinson-schensted process. Stoch. Process. Appl. 127(2), 449–474 (2017)
Okounkov, A.: Random matrices and random permutations. Int. Math. Res. Not. 20, 1043–1095 (2000). arXiv:math/9903176
Petrov, L.: Asymptotics of random lozenge tilings via Gelfand–Tsetlin schemes. Probab. Theory Relat. Fields 160(3), 429–487 (2014)
Rahman, M., Virág, B., Vizer, M.: Geometry of permutation limits, preprint (2016). arXiv:1609.03891
Romik, D.: The Surprising Mathematics of Longest Increasing Subsequences. Cambridge University Press, Cambridge (2015)
Rozinov, A.: Statistics of random sorting networks. Ph.D. Thesis, Courant Institute, New York (2016)
Stanley, R.P.: On the number of reduced decompositions of elements of Coxeter groups. Eur. J. Combin. 5(4), 359–372 (1984)
Acknowledgements
We would like to thank Balint Virág, who brought our attention to the problem of identifying the local limit of sorting networks. We are grateful to Alexei Borodin, Percy Deift, and Igor Krasovsky for valuable discussions and references. We would also like to thank an anonymous referee for an exceptionally careful reading of the paper and some helpful feedback. V. Gorin’s research was partially supported by NSF grants DMS-1407562, DMS-1664619, by a Sloan Research Fellowship, by The Foundation Sciences Mathématiques de Paris, and by NEC Corporation Fund for Research in Computers and Communications. M. Rahman’s research was partially supported by an NSERC PDF award.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gorin, V., Rahman, M. Random sorting networks: local statistics via random matrix laws. Probab. Theory Relat. Fields 175, 45–96 (2019). https://doi.org/10.1007/s00440-018-0886-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-018-0886-1
Keywords
- Sorting network
- Reduced decomposition
- Gaudin–Mehta law
- GUE corners
- Young tableau
- Determinantal point process
Mathematics Subject Classification
- 60G55
- 60B20
- 05E15
- 82C22