English

Uniqueness of maximal entropy measure on essential spanning forests

Probability 2007-05-23 v2 Combinatorics

Abstract

An essential spanning forest of an infinite graph GG is a spanning forest of GG in which all trees have infinitely many vertices. Let GnG_n be an increasing sequence of finite connected subgraphs of GG for which Gn=G\bigcup G_n=G. Pemantle's arguments imply that the uniform measures on spanning trees of GnG_n converge weakly to an Aut(G)\operatorname {Aut}(G)-invariant measure μG\mu_G on essential spanning forests of GG. We show that if GG is a connected, amenable graph and ΓAut(G)\Gamma \subset \operatorname {Aut}(G) acts quasitransitively on GG, then μG\mu_G is the unique Γ\Gamma-invariant measure on essential spanning forests of GG for which the specific entropy is maximal. This result originated with Burton and Pemantle, who gave a short but incorrect proof in the case ΓZd\Gamma\cong\mathbb{Z}^d. 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)

R2 v1 2026-07-22T17:07:09.949Z