2 problems

Consider Herman's token process on a cycle of $N$ nodes, started from any initial configuration with an odd number of tokens, and let $E(\mathbf{T})$ be the expected time until one…

Consider a cycle of $N$ nodes with an odd number of tokens. At each step, each token independently moves to its clockwise neighbor or stays at its position with probability…