Graph explorer

Excited Random Walk

A random walk on Z^d is excited if the first time it visits a vertex there is a bias in one direction, but on subsequent visits to that vertex the walker picks a neighbor uniformly at random. We show that excited random walk on Z^d, is transient iff d>1.

4 nodes3 linksoverview previewExcited Random Walk
4 nodes3 links
Excited Random Walk4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWExcited Random Walkpreprint / 2004AItai BenjaminiResearcherADavid B. WilsonResearcherTmath.PR7239 works
PaperSignal 103 links

Excited Random Walk

preprint / 2004

Open