Random walks on the BMW monoid: an algebraic approach

DOI10.1007/S10801-018-0858-7zbMATH Open1427.60015arXiv1605.05136OpenAlexW2963273732MaRDI QIDQ2011393FDOQ2011393

Authors: Sarah Wolff 

Publication date: 6 December 2019

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1605.05136

Recommendations

• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Generating random braids
• Random walk invariants of string links from R-matrices
• CYCLOTOMIC BIRMAN–WENZL–MURAKAMI ALGEBRAS, I: FREENESS AND REALIZATION AS TANGLE ALGEBRAS
• Semigroups, rings, and Markov chains

zbMATH Keywords

random walksrepresentation theorysemisimple algebrasmetropolis algorithmsystematic scans

Mathematics Subject Classification ID

Probability theory on algebraic and topological structures (60B99) Random walks on graphs (05C81) Probabilistic methods in group theory (20P05)

Cites Work

• Monte Carlo strategies in scientific computing.
• Title not available (Why is that?)
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Equation of state calculations by fast computing machines
• Markov Chains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tensor product representations for orthosymplectic Lie superalgebras
• Harmonic analysis on finite groups. Representation theory, Gelfand pairs and Markov chains
• Young's orthogonal form for Brauer's centralizer algebra
• Affine Birman–Wenzl–Murakami algebras and tangles in the solid torus
• Title not available (Why is that?)
• Fast generalized Fourier transforms
• Title not available (Why is that?)
• Separation of variables and the computation of Fourier transforms on finite groups, I
• Title not available (Why is that?)
• Coordinate selection rules for Gibbs sampling
• The efficient computation of Fourier transforms on semisimple algebras
• Fourier transform over semi-simple algebras and harmonic analysis for probabilistic algorithms

Cited In (2)

• The efficient computation of Fourier transforms on semisimple algebras
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

This page was built for publication: Random walks on the BMW monoid: an algebraic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011393)