Cutpoints and resistance of random walk paths

DOI10.1214/10-AOP569zbMath1223.60012arXiv0902.0115OpenAlexW3106494167MaRDI QIDQ533749

Ori Gurel-Gurevich, Itai Benjamini, Oded Schramm

Publication date: 6 May 2011

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.0115

zbMATH Keywords

random walkelectrical networkgraph cutpointspaths of a random walk

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50)

Related Items (4)

Recurrence of Markov chain traces ⋮ Most transient random walks have infinitely many cut times ⋮ Growth exponent for loop-erased random walk in three dimensions ⋮ Cutpoints of non-homogeneous random walks

Cites Work

• On the number of cutpoints of the transient nearest neighbor random walk on the line
• Isoperimetric inequalities and transient random walks on graphs
• Cut times for simple random walk
• Recurrence of random walk traces
• A transient Markov chain with finitely many cutpoints
• Cutpoints and Exchangeable Events for Random Walks

This page was built for publication: Cutpoints and resistance of random walk paths