Burau representation and random walk on string links
Abstract
Using a probabilistic interpretation of the Burau representation of the braid group offered by Vaughan Jones, we generalize the Burau representation to a representation of the semigroup of string links. This representation is determined by a linear system, and is dominated by finite type string link invariants. For positive string links, the representation matrix can be interpreted as the transition matrix of a Markov process. For positive non-separable links, we show that all states are persistent. (This is an extensively revised version of the first author's original paper titled "Burau representation and random walk on knots".)
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.