Random walks on semaphore codes and delay de Bruijn semigroups
Group Theory
2016-07-08 v2 Combinatorics
Probability
Abstract
We develop a new approach to random walks on de Bruijn graphs over the alphabet through right congruences on , defined using the natural right action of . A major role is played by special right congruences, which correspond to semaphore codes and allow an easier computation of the hitting time. We show how right congruences can be approximated by special right congruences.
Cite
@article{arxiv.1509.03383,
title = {Random walks on semaphore codes and delay de Bruijn semigroups},
author = {John Rhodes and Anne Schilling and Pedro V. Silva},
journal= {arXiv preprint arXiv:1509.03383},
year = {2016}
}
Comments
34 pages; 10 figures; as requested by the journal, the previous version of this paper was divided into two; this version contains Sections 1-8 of version 1; Sections 9-12 will appear as a separate paper with extra material added