Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs |
scientific article |
Statements
Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (English)
0 references
18 May 2015
0 references
discrete complex systems
0 references
Lights-Out games
0 references
reachability
0 references
0 references
