Mathematics – Combinatorics
Scientific paper
2011-01-13
Mathematics
Combinatorics
10 pages
Scientific paper
We prove the existence of recurrent initial configurations for the rotor walk
on many graphs, including Z^d, and planar graphs with locally finite
embeddings. We also prove that recurrence and transience of rotor walks are
invariant under changes in the starting vertex and finite changes in the
initial configuration.
Angel Omer
Holroyd Alexander E.
No associations
LandOfFree
Recurrent Rotor-Router Configurations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Recurrent Rotor-Router Configurations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recurrent Rotor-Router Configurations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-65806