Ends in free minimal spanning forests
Probability
2016-08-16 v1
Abstract
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.
Cite
@article{arxiv.math/0606750,
title = {Ends in free minimal spanning forests},
author = {Ádám Timár},
journal= {arXiv preprint arXiv:math/0606750},
year = {2016}
}
Comments
Published at http://dx.doi.org/10.1214/009117906000000025 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)