Trust Signal Map
Public graph snapshot linking moderation, structured review and trust-aware ranking.
Graph explorer
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.
preprint / 2004