The rotor-router group of directed covers of graphs

zbMATH Open1252.05209arXiv1206.4267MaRDI QIDQ456362FDOQ456362

Authors: Wilfried Huss, Ecaterina Sava 

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1206.4267

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Transience and recurrence of rotor-router walks on directed covers of graphs
• The rotor-router model on regular trees
• Orbits of rotor-router operation and stationary distribution of random walks on directed graphs

zbMATH Keywords

finite graphssandpile groupdirected coversperiodic treesrotor-router grouprotor-router walks

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks on graphs (05C81) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Cited In (2)

• Transience and recurrence of rotor-router walks on directed covers of graphs
• Erratum to: ``Transience and recurrence of rotor-router walks on directed covers of graphs

This page was built for publication: The rotor-router group of directed covers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456362)