Abstract
Random transvections generate a walk on the space of symplectic forms on . The main result is establishing cutoff for this Markov chain. After steps, the walk is close to uniform while before , it is far from uniform. The upper bound is proved by explicitly finding and bounding the eigenvalues of the random walk. The lower bound is found by showing that the support of the walk is exponentially small if only steps are taken. The result can be viewed as a -deformation of a result of Diaconis and Holmes on a random walk on matchings.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.