# Rotor Walks on General Trees

@article{Angel2010RotorWO, title={Rotor Walks on General Trees}, author={Omer Angel and Alexander E. Holroyd}, journal={SIAM J. Discrete Math.}, year={2010}, volume={25}, pages={423-446} }

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighboring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an infinite rooted tree, restarted from the root after each escape to infinity. We prove that the limiting proportion of escapes to infinity equals the escape probability for random walk, provided only finitely many rotors send the walker initially toward the root… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 15 CITATIONS

## Infinite Excursions of Router Walks on Regular Trees

VIEW 4 EXCERPTS

CITES RESULTS, BACKGROUND & METHODS

HIGHLY INFLUENCED

## A Note on the Fundamental Groups and Covers of Lattice Walk

VIEW 1 EXCERPT

CITES BACKGROUND

## The range of a rotor walk

VIEW 3 EXCERPTS

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 21 REFERENCES

## The rotor-router model on regular trees

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Chip-Firing and Rotor-Routing on Directed Graphs

VIEW 4 EXCERPTS

## Fast Simulation of Large-Scale Growth Models

VIEW 1 EXCERPT

## Rotor-Router Aggregation on the Layered Square Lattice

VIEW 1 EXCERPT

## Rotor Walks and Markov Chains

VIEW 2 EXCERPTS

## The sandpile group of a tree

VIEW 1 EXCERPT

## Deterministic random walks on regular trees

VIEW 2 EXCERPTS

## Quasirandom rumor spreading

VIEW 1 EXCERPT