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 the normal view instead:
scientific article; zbMATH DE number 6436217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs |
scientific article; zbMATH DE number 6436217 |
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
0 references
0 references
0.8265964
0 references
0.8255672
0 references
0.8226863
0 references
