Uniqueness of maximal entropy measure on essential spanning forests

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

G_{n}

be an increasing sequence of finite connected subgraphs of

G

for which

. Pemantle's arguments imply that the uniform measures on spanning trees of

G_{n}

converge weakly to an

o p e r a t o r n a m e A u t (G)

-invariant measure

m u_{G}

on essential spanning forests of

G

. We show that if

G

is a connected, amenable graph and

G a m m a s u b s e t o p e r a t o r n a m e A u t (G)

acts quasitransitively on

G

, then

m u_{G}

is the unique

G a m m a

-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

G a m m a c o n g m a t h b b Z^{d}

. Lyons discovered the error and asked about the more general statement that we prove.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Uniqueness of maximal entropy measure on essential spanning forests