Recurrent Rotor-Router Configurations

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-65806

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.