We show how to rigorously complete the program outlined in Wendelin Werner's talk in the special case of two-dimensional spanning trees, building on some ideas and results about the scaling limits of loop-erased random walks and their lengths.
view more