Let X be a finite set and S a semigroup of transformations of X. We investigate the trace on X of a random walk on S. We relate the structure of the trace process, which turns out to be a Markov chain, to that of the random walk. We show, for example, that all periods of the trace process divide the period of the random walk.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between September 2016 - 25th May 2017. This data will be updated every 24 hours.