Random sorting networks: edge limit

Vadim Gorin, Jiaming Xu

A sorting network is a shortest path from $12\dots n$ to $n\dots 21$ in the Cayley graph of the symmetric group ${\mathfrak{S}}_n$ spanned by adjacent transpositions. The paper comput…