Uniqueness of maximal entropy measure on essential spanning forests
Abstract
An essential spanning forest of an infinite graph is a spanning forest of in which all trees have infinitely many vertices. Let be an increasing sequence of finite connected subgraphs of for which . Pemantle's arguments imply that the uniform measures on spanning trees of converge weakly to an -invariant measure on essential spanning forests of . We show that if is a connected, amenable graph and acts quasitransitively on , then is the unique -invariant measure on essential spanning forests of for which the specific entropy is maximal. This result originated with Burton and Pemantle, who gave a short but incorrect proof in the case . Lyons discovered the error and asked about the more general statement that we prove.
Keywords
Cite
@article{arxiv.math/0406513,
title = {Uniqueness of maximal entropy measure on essential spanning forests},
author = {Scott Sheffield},
journal= {arXiv preprint arXiv:math/0406513},
year = {2007}
}
Comments
Published at http://dx.doi.org/10.1214/009117905000000765 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)