On which graphs are all random walks in random environments transient?
| dc.creator | Pemantle, Robin | |
| dc.creator | Peres, Yuval | |
| dc.date | 2004-04-05 | |
| dc.date.accessioned | 2026-07-07T05:07:07Z | |
| dc.date.available | 2026-07-07T05:07:07Z | |
| dc.description | 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. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0404087 | |
| dc.identifier | http://arxiv.org/abs/math/0404087 | |
| dc.identifier | Random Discrete Structures, 207 - 211, IMA Vol. Math. Appl., 76, Springer(1996) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70736 | |
| dc.subject | Probability | |
| dc.subject | 60K35 (Primary) 60J15 (Secondary) | |
| dc.title | On which graphs are all random walks in random environments transient? | |
| dc.type | text |