A pattern theorem for random sorting networks

DOI10.1214/EJP.v17-2448zbMath1284.60021arXiv1110.0160OpenAlexW2110562284MaRDI QIDQ392684

Alexander E. Holroyd, Vadim Gorin, Omer Angel

Publication date: 15 January 2014

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

Young tableaupatternrandom sortingreduced wordsorting network

Mathematics Subject Classification ID

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

Related Items (7)

Absorbing time asymptotics in the oriented swap process ⋮ The Archimedean limit of random sorting networks ⋮ Shift-invariance of the colored TASEP and finishing times of the oriented swap process ⋮ Relating Edelman-Greene insertion to the Little map ⋮ On collisions times of `self-sorting' interacting particles in one-dimension with random initial positions and velocities ⋮ Random sorting networks: local statistics via random matrix laws ⋮ Circular support in random sorting networks

This page was built for publication: A pattern theorem for random sorting networks