Duke/UNC Graduate student probability conference
Friday, May 1, 2009, 4:30pm, UNC Statistics
Russ Lyons (University of Indiana)
Asymptotic Enumeration of Spanning Trees via Traces and Random Walks
Abstract:- Methods of enumeration of spanning trees in a finite graph and relations to
various areas of mathematics and physics have been investigated for more
than 150 years. We will review the history and applications. Then we will
give new formulas for the asymptotics of the number of spanning trees of
large graphs. 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
[Fuglede-Kadison] determinant of the graph Laplacian for infinite graphs.
Proofs involve new traces and the theory of random walks.
Generated at 10:57am Thursday, April 18, 2024 by Mcal. Top
* Reload
* Login