Shortest spanning trees and a counterexample for random walks in random environments

Maury Bramson, Ofer Zeitouni, Martin P. W. Zerner

We construct forests that span ${\mathbb{Z}}^d$, $d\ge 2$, that are stationary and directed, and whose trees are infinite, but for which the subtrees attached to each vertex are as s…