On which graphs are all random walks in random environments transient?

2004/04/05 by Robin Pemantle, Yuval Peres
Mathematics · #math.PR #msc:60K35 #msc:60J15

paper · pdf

published as Random Discrete Structures, 207 - 211, IMA Vol. Math. Appl., 76, Springer(1996) · 7 pages

arxiv created 2004/04/05 · arxiv updated 2009/12/01

Abstract

An infinite graph G has the property that a random walk in random environment on G defined by i.i.d. resistances with any common distribution is almost surely transient, if and only if for some p<1, simple random walk is transient on a percolation cluster of G under bond percolation with parameter p.

Related

• Existence of graphs with sub exponential transitions probability decay and applications
• Oriented Random Walk on the Heisenberg Group and Percolation
• Existence of the harmonic measure for random walks on graphs and in random environments
• Critical RWRE on trees and tree-indexed random walks
• Speed of random walk on dynamical percolation in nonamenable transitive graphs