Geometric estimates for the uniform spanning forest

The uniform spanning forest (USF) in a graph

is a random spanning forest obtained as the limit of uniformly chosen spanning

trees on finite subgraphs. The USF is known to have stochastic dimension 4 on

graphs that are "at least 4 dimensional" in a certain sense. In this

talk I will look at more detailed estimates on the geometry of a fixed

component of the USF in the special case of the d-dimensional integer lattice,

d > 4. This is motivated in part by the study of random walk restricted to a

fixed component of the USF.