Random subnetworks of random sorting networks

zbMath1197.60003arXiv0911.2519MaRDI QIDQ976676

Alexander E. Holroyd, Omer Angel

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

reduced wordPolya urngreat circle conjecturerandom sorting network

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial probability (60C05)

Related Items

Absorbing time asymptotics in the oriented swap process ⋮ The Archimedean limit of random sorting networks ⋮ Relating Edelman-Greene insertion to the Little map ⋮ Random sorting networks: local statistics via random matrix laws ⋮ A combinatorial version of Sylvester's four-point problem ⋮ Circular support in random sorting networks

This page was built for publication: Random subnetworks of random sorting networks