Asymptotic Enumeration of Spanning Trees
RUSSELL LYONS
Source record
Source: Crossref
Published: Jul 1, 2005
DOI: 10.1017/s096354830500684x
Open original source ↗Source abstract
We give new formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay [ Europ. J. Combin . 4 149–160] 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 [ Ann. Probab . 21 1329–1371].
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.