146 citations · 520 across the 35 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.PR2011★ 2 cited
A pattern theorem for random sorting networks
Omer Angel, Vadim Gorin, Alexander E. Holroyd
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…
math.RT2011
Block characters of the symmetric groups
Alexander Gnedin, Vadim Gorin, Sergei Kerov
Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters…
math.PR2011★ 10 cited
Markov processes of infinitely many nonintersecting random walks
Alexei Borodin, Vadim Gorin
Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these…