Ends in free minimal spanning forests

Timár, Ádám

Timár, Ádám

Ann. Probab., Tome 34 (2006) no. 1, p. 865-869 / Harvested from Project Euclid

Résumé

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.

Publié le : 2006-05-14
Classification: Minimal spanning forest, number of ends, indistinguishability, 60B99, 60D05

@article{1151418485,
     author = {Tim\'ar, \'Ad\'am},
     title = {Ends in free minimal spanning forests},
     journal = {Ann. Probab.},
     volume = {34},
     number = {1},
     year = {2006},
     pages = { 865-869},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1151418485}
}

Timár, Ádám. Ends in free minimal spanning forests. Ann. Probab., Tome 34 (2006) no. 1, pp.  865-869. http://gdmltest.u-ga.fr/item/1151418485/