A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A pattern theorem for random sorting networks

2012
*
Electronic Journal of Probability
*

A sorting network is a shortest path from 12 · · · n to n · · · 21 in the Cayley graph of the symmetric group S n generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove that in a uniformly random n-element sorting network, any fixed pattern occurs in at least cn 2 disjoint space-time locations, with probability tending to 1 exponentially fast as n → ∞. Here c is a positive constant which depends on the choice of

doi:10.1214/ejp.v17-2448
fatcat:xhqdiy4bondmheopnmbqtt25tm