The Range of a Random Walk on a Comb

Pach, János; Tardos, Gábor

doi:10.37236/3571

Search citation statements

Order By: Relevance

Paper Sections

Select...

O X1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the precise statement, see §4. This result contrasts with random walk on the comb, for which the expected number of sites visited is only on the order of t 1/2 log t as shown by Pach and Tardos [15]. Thus the uniform rotor walk explores the comb more efficiently than random walk.…”

Section: O Xmentioning

confidence: 81%

The Range of a Rotor Walk

Florescu¹,

Levine²,

Peres³

2016

The American Mathematical Monthly

View full text Add to dashboard Cite

In a rotor walk the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in R d , we show that any simple rotor walk, regardless of rotor mechanism or initial rotor configuration, visits at least on the order of t d/(d+1) distinct sites in t steps. We prove a shape theorem for the rotor walk on the comb graph with i.i.d. uniform initial rotors, showing that the range is of order t 2/3 and the asymptotic shape of the range is a diamond. Using a connection to the mirror model and critical percolation, we show that rotor walk with i.i.d. uniform initial rotors is recurrent on two different directed graphs obtained by orienting the edges of the square grid, the Manhattan lattice and the F -lattice. We end with a short discussion of the time it takes for rotor walk to cover a finite Eulerian graph. * florescu@cims.nyu.edu †

show abstract

Section: O Xmentioning

confidence: 81%