The rotor-router group of directed covers of graphs (Q456362)
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: The rotor-router group of directed covers of graphs |
scientific article; zbMATH DE number 6098372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The rotor-router group of directed covers of graphs |
scientific article; zbMATH DE number 6098372 |
Statements
The rotor-router group of directed covers of graphs (English)
0 references
24 October 2012
0 references
Summary: A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we study several quantities related to rotor-router walks on directed covers. The quantities under consideration are: order of the rotor-router group, order of the root element in the rotor-router group and the connection with random walks.
0 references
finite graphs
0 references
directed covers
0 references
periodic trees
0 references
rotor-router walks
0 references
rotor-router group
0 references
sandpile group
0 references
0.8538288474082947
0 references
0.7899479269981384
0 references
