Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:48, 5 March 2024
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
