Random sorting networks: local statistics via random matrix laws

DOI10.1007/S00440-018-0886-1MaRDI QIDQ2273593zbMATH OpenOpenAlexWikidataFDO

Authors Vadim Gorin, Mustazee Rahman

Publication date 24 September 2019

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.07895, https://hdl.handle.net/1721.1/122937

zbMATH Keywords

determinantal point processGaudin-Mehta lawGUE cornersreduced decompositionsorting networkYoung tableau

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting particle systems in time-dependent statistical mechanics (82C22)

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.

Recommendations

• The local limit of random sorting networks
• Random sorting networks
• The Archimedean limit of random sorting networks
• Sorting networks, staircase Young tableaux, and last passage percolation
• Random subnetworks of random sorting networks

Cites work

• A pattern theorem for random sorting networks
• A Riemann-Hilbert approach to asymptotic problems arising in the theory of random matrix models, and also in the theory of integrable statistical mechanics
• An Introduction to the Theory of Point Processes
• Asymptotic behavior of spacing distributions for the eigenvalues of random matrices
• Asymptotic geometry of discrete interlaced patterns. I
• Asymptotics of Plancherel measures for symmetric groups
• Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes
• Balanced tableaux
• Circular support in random sorting networks
• Decorated Young tableaux and the poissonized Robinson-Schensted process
• Determinantal point processes
• Discrete orthogonal polynomial ensembles and the Plancherel measure
• Dyson's constant in the asymptotics of the Fredholm determinant of the sine kernel
• Dyson's constants in the asymptotics of the determinants of Wiener-Hopf-Hankel operators with the sine kernel
• Fredholm determinants and inverse scattering problems
• Geometry of permutation limits
• scientific article; zbMATH DE number 1549030 (Why is no real title available?)
• scientific article; zbMATH DE number 2207682 (Why is no real title available?)
• Integrable probability: from representation theory to MacDonald processes
• Lectures on integrable probability
• Log-gases and random matrices.
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the number of reduced decompositions of elements of Coxeter groups
• Orbit measures, random matrix theory and interlaced determinantal processes
• Random sorting networks
• Random subnetworks of random sorting networks
• Relating Edelman-Greene insertion to the Little map
• Sur la loi limite de l'espacement des valeurs propres d'une matrice ale´atoire
• The Anti-Symmetric GUE Minor Process
• The Archimedean limit of random sorting networks
• The local limit of random sorting networks
• The oriented swap process
• The surprising mathematics of longest increasing subsequences
• The Widom--Dyson constant for the gap probability in random matrix theory
• The Young bouquet and its boundary

Cited in

(18)

• The oriented swap process
• The local limit of random sorting networks
• Absorbing time asymptotics in the oriented swap process
• Sorting networks, staircase Young tableaux, and last passage percolation
• Shift-invariance of the colored TASEP and finishing times of the oriented swap process
• A pattern theorem for random sorting networks
• Maxima of log-correlated fields: some recent developments*
• The Archimedean limit of random sorting networks
• Circular support in random sorting networks
• Trajectories in random minimal transposition factorizations
• The oriented swap process and last passage percolation
• Random sorting networks: edge limit
• Grothendieck shenanigans: permutons from pipe dreams via integrable probability
• The global and local limit of the continuous-time Mallows process
• Fluctuations of Schensted row insertion
• A determinantal point process approach to scaling and local limits of random Young tableaux
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• Random subnetworks of random sorting networks

This page was built for publication: Random sorting networks: local statistics via random matrix laws

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273593)