arXiv Analytics

Sign in

arXiv:1605.05136 [math.PR]AbstractReferencesReviewsResources

Random walks on the BMW monoid: an algebraic approach

Sarah Wolff

Published 2016-05-17Version 1

We consider Metropolis-based systematic scan algorithms for generating Birman-Murakami-Wenzl (BMW) monoid basis elements of the BMW algebra. As the BMW monoid consists of tangle diagrams, these scanning strategies can be rephrased as random walks on links and tangles. We translate these walks into left multiplication operators in the corresponding BMW algebra. Taking this algebraic perspective enables the use of tools from representation theory to analyze the walks; in particular, we develop a norm arising from a trace function on the BMW algebra to analyze the time to stationarity of the walks.

Comments: 24 pages, 9 figures
Categories: math.PR
Subjects: 60J10, 60B15, 65C05, 65C40, 17B20
Related articles: Most relevant | Search more
arXiv:0807.2264 [math.PR] (Published 2008-07-14)
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups
arXiv:math/0309011 [math.PR] (Published 2003-08-31, updated 2004-04-27)
Random walks on the torus with several generators
arXiv:0810.2681 [math.PR] (Published 2008-10-15)
From random walks to rough paths

Links

Toolbox