Uniqueness of maximal entropy measure on essential spanning forests

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/009117905000000765 in the Annals of Probability (http://www.imstat.org/aop/) by the Ins

Scientific paper

10.1214/009117905000000765

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 $\bigcup G_n=G$. Pemantle's arguments imply that the uniform measures on spanning trees of $G_n$ converge weakly to an $\operatorname {Aut}(G)$-invariant measure $\mu_G$ on essential spanning forests of $G$. We show that if $G$ is a connected, amenable graph and $\Gamma \subset \operatorname {Aut}(G)$ acts quasitransitively on $G$, then $\mu_G$ is the unique $\Gamma$-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 $\Gamma\cong\mathbb{Z}^d$. Lyons discovered the error and asked about the more general statement that we prove.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Uniqueness of maximal entropy measure on essential spanning forests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uniqueness of maximal entropy measure on essential spanning forests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniqueness of maximal entropy measure on essential spanning forests will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-206462

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.