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]
@article{Istrate15-0,
title = {Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs},
author = {Gabriel Istrate},
year = {2015},
doi = {10.1016/j.tcs.2015.02.035},
url = {http://dx.doi.org/10.1016/j.tcs.2015.02.035},
researchr = {https://researchr.org/publication/Istrate15-0},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {580},
pages = {83-93},
}