Random sorting networks: local statistics via random matrix laws
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 de...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/1721.1/122937 |