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 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…