The local limit of random sorting networks

DOI10.1214/18-AIHP887zbMath1455.60016arXiv1702.08368OpenAlexW2951517720MaRDI QIDQ1731150

Duncan Dauvergne, Omer Angel, Alexander E. Holroyd, Bálint Virág

Publication date: 20 March 2019

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.08368

zbMATH Keywords

Young tableaulocal limitsorting networkreduced decompositionrandom sorting network

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial aspects of representation theory (05E10) Combinatorial probability (60C05)

Related Items (10)

Absorbing time asymptotics in the oriented swap process ⋮ Random stable-type minimal factorizations of the n-cycle ⋮ Milnor invariants of sorting networks ⋮ The Archimedean limit of random sorting networks ⋮ The oriented swap process and last passage percolation ⋮ Ungarian Markov chains ⋮ Sorting networks, staircase Young tableaux, and last passage percolation ⋮ Random sorting networks: local statistics via random matrix laws ⋮ Circular support in random sorting networks ⋮ Trajectories in random minimal transposition factorizations

This page was built for publication: The local limit of random sorting networks