Ends in free minimal spanning forests

• Ádám Timár ^[1]
  1. [1] Indiana University
• Localización: Annals of probability: An official journal of the Institute of Mathematical Statistics, ISSN 0091-1798, Vol. 34, Nº. 3, 2006, págs. 865-869
• Idioma: inglés
• DOI: 10.1214/009117906000000025
• Texto completo no disponible (Saber más ...)
• Resumen

  • We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm.