Random sorting networks: local statistics via random matrix laws
From MaRDI portal
Publication:2273593
DOI10.1007/s00440-018-0886-1zbMath1422.60081arXiv1702.07895OpenAlexW2594206683WikidataQ128984168 ScholiaQ128984168MaRDI QIDQ2273593
Publication date: 24 September 2019
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07895
Young tableaudeterminantal point processsorting networkreduced decompositionGaudin-Mehta lawGUE corners
Random matrices (probabilistic aspects) (60B20) Interacting particle systems in time-dependent statistical mechanics (82C22) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (7)
Absorbing time asymptotics in the oriented swap process ⋮ Maxima of log-correlated fields: some recent developments* ⋮ The Archimedean limit of random sorting networks ⋮ Shift-invariance of the colored TASEP and finishing times of the oriented swap process ⋮ Circular support in random sorting networks ⋮ Trajectories in random minimal transposition factorizations ⋮ Periodic Pólya urns, the density method and asymptotics of Young tableaux
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A pattern theorem for random sorting networks
- Relating Edelman-Greene insertion to the Little map
- Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes
- Decorated Young tableaux and the poissonized Robinson-Schensted process
- Dyson's constant in the asymptotics of the Fredholm determinant of the sine kernel
- The Widom--Dyson constant for the gap probability in random matrix theory
- Orbit measures, random matrix theory and interlaced determinantal processes
- Random subnetworks of random sorting networks
- The oriented swap process
- On the number of reduced decompositions of elements of Coxeter groups
- A Riemann-Hilbert approach to asymptotic problems arising in the theory of random matrix models, and also in the theory of integrable statistical mechanics
- Fredholm determinants and inverse scattering problems
- The local limit of random sorting networks
- Balanced tableaux
- Geometry of permutation limits
- Random sorting networks
- Integrable probability: from representation theory to MacDonald processes
- Dyson's constants in the asymptotics of the determinants of Wiener-Hopf-Hankel operators with the sine kernel
- The Surprising Mathematics of Longest Increasing Subsequences
- Asymptotic behavior of spacing distributions for the eigenvalues of random matrices
- Asymptotic geometry of discrete interlaced patterns: Part I
- The Anti-Symmetric GUE Minor Process
- Sur la loi limite de l'espacement des valeurs propres d'une matrice ale´atoire
- On the distribution of the length of the longest increasing subsequence of random permutations
- Lectures on integrable probability
- An Introduction to the Theory of Point Processes
- Asymptotics of Plancherel measures for symmetric groups
- The Archimedean limit of random sorting networks
- Circular support in random sorting networks
- The Young bouquet and its boundary
- Discrete orthogonal polynomial ensembles and the Plancherel measure
This page was built for publication: Random sorting networks: local statistics via random matrix laws