Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs

Gabriel Istrate. Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs. Theoretical Computer Science, 580:83-93, 2015. [doi]

Abstract

Abstract is missing.