TITLE: A colorful fractal structure on a graph provided by Wilson's algorithm: any explanation?
QUESTION [5 upvotes]: Consider a big finite rescaled piece of $\mathbb{Z}^2$, i.e. consider a unit square with a thick grid. Famous Wilson's method allows to generate a colored spanning tree of such a graph in a uniform way by popping out the cycles: if the mesh-size tends to 0, then the interesting fractal structure occurs: one can read about this in  R.Lyons, Y. Peres Probability on Trees and Networks. It is said there, that this fractal structure is not yet explained. Could someone point to me some works connected to this question, if there are any?

REPLY [5 votes]: Is this the fractal structure you have in mind?

   
Image from Russell Lyons' book page. Figure 4.6 in the book. Caption:
   
"The distances in the tree to the path between opposite
corners in a uniform spanning tree in a 200x200 grid."