Random walks on the BMW monoid: an algebraic approach

DOI10.1007/s10801-018-0858-7zbMath1427.60015arXiv1605.05136OpenAlexW2963273732MaRDI QIDQ2011393

Sarah Wolff

Publication date: 6 December 2019

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

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

zbMATH Keywords

random walksrepresentation theorysemisimple algebrasmetropolis algorithmsystematic scans

Mathematics Subject Classification ID

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

Related Items (1)

The efficient computation of Fourier transforms on semisimple algebras

Cites Work

• Fast generalized Fourier transforms
• Tensor product representations for orthosymplectic Lie superalgebras
• The efficient computation of Fourier transforms on semisimple algebras
• Coordinate selection rules for Gibbs sampling
• Fourier transform over semi-simple algebras and harmonic analysis for probabilistic algorithms
• Young's orthogonal form for Brauer's centralizer algebra
• Monte Carlo strategies in scientific computing.
• Markov Chains
• Equation of State Calculations by Fast Computing Machines
• Affine Birman–Wenzl–Murakami algebras and tangles in the solid torus
• Separation of variables and the computation of Fourier transforms on finite groups, I
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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