Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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?

share|improve this question
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
add comment

1 Answer 1

Is this the fractal structure you have in mind?
distances spanning tree
    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."

share|improve this answer
This fractal can also be built in SimCity 2K. –  Vidit Nanda Jul 21 '13 at 23:38
Cool! ${}{}{}{}{}{}$ –  Joseph O'Rourke Jul 21 '13 at 23:57
This is a 3D-picture of distances but already a 2D picture (it's projection) is interesting: the colors are the colors of the cycles that are popped in Wilson's method. I have in mind a picture from the same book, one page before. –  Olga Jul 22 '13 at 6:49
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.