Asymptotic Enumeration of Spanning Trees

Details Asymptotic Enumeration of Spanning Trees Asymptotic Enumeration of Spanning Trees

2002-12-11

arxiv.org/abs/math/0212165v7

Combin. Probab. Comput. 14 (2005), 491-522.

Mathematics

Combinatorics

38 pages

Scientific paper

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call "tree entropy", which we show is a logarithm of a normalized determinant of the graph Laplacian for infinite graphs. Tree entropy is also expressed using random walks. We relate tree entropy to the metric entropy of the uniform spanning forest process on quasi-transitive amenable graphs, extending a result of Burton and Pemantle (1993).

Affiliated with

Also associated with

No associations

Rating

Asymptotic Enumeration of Spanning Trees 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 Asymptotic Enumeration of Spanning Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Enumeration of Spanning Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-404462