Bumping sequences and multispecies juggling (Q1647943): Difference between revisions

The theme of this paper is the explicit calculation of the stationary distribution of a certain class of Markov chains. This chain is called the multispecies juggling Markov chain. Formally, this is a Markov chain on words that contain \(n\) letters where the alphabet is the set \(\{1,\ldots, T\}\). The condition is that each word has \(n_i\) letters of type \(i\). The words are the states of the Markov chain and the transitions take place by putting the first letter in some other random position. The choice of the position is made according to the structure of the word. Generalisations of this chain are also considered.