Publication View

Uniqueness of maximal entropy measure on essential spanning forests (2006)

Abstract
An essential spanning forest of an infinite graph G is a spanning forest of G in which all trees have infinitely many vertices. Let Gn be an increasing sequence of finite connected subgraphs of G for which ⋃Gn=G. Pemantle’s arguments imply that the uniform measures on spanning trees of Gn converge weakly to an Aut (G)-invariant measure μG on essential spanning forests of G. We show that if G is a connected, amenable graph and Γ⊂Aut (G) acts quasitransitively on G, then μG is the unique Γ-invariant measure on essential spanning forests of G for which the specific entropy is maximal. This result originated with Burton and Pemantle, who gave a short but incorrect proof in the case Γ≅ℤd. Lyons discovered the error and asked about the more general statement that we prove.

Publication details
Download http://ProjectEuclid.org/getRecord?id=euclid.aop/1151418484
Publisher The Institute of Mathematical Statistics
Repository Project Euclid (Hosted at Cornell University Library) (United States)
Keywords 60D05 (MSC2000), Amenable, essential spanning forest, ergodic, specific entropy
Type text
Language Englisch