On which Graphs are All Random Walks in Random Environments Transient?

  • Pemantle R
  • Peres Y
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Pemantle, R., & Peres, Y. (1996). On which Graphs are All Random Walks in Random Environments Transient? (pp. 207–211). https://doi.org/10.1007/978-1-4612-0719-1_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free