Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent

DOI10.1016/0012-365X(86)90107-XzbMath0599.05018MaRDI QIDQ1080429

Peter Gerl

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

recurrencespanning treerandom walk

Mathematics Subject Classification ID

Trees (05C05) Sums of independent random variables; random walks (60G50)

Related Items (3)

A phase transition in random coin tossing ⋮ Harmonic analysis invariants for infinite graphs via operators and algorithms ⋮ Uniform asymptotic estimates of transition probabilities on combs

Cites Work

• Recurrent and transient trees
• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent