# A colorful fractal structure on a graph provided by Wilson's algorithm: any explanation?

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?

-
Have you tried contacting Lyons and/or Peres? –  Gerry Myerson Jul 21 '13 at 23:38
Not yet, I first though about asking in the club.) –  Olga Jul 22 '13 at 6:52

Cool! ${}{}{}{}{}{}$ –  Joseph O'Rourke Jul 21 '13 at 23:57