Identities and Inequalities for Tree Entropy
2009 ◽
Vol 19
(2)
◽
pp. 303-313
◽
Keyword(s):
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses Fuglede–Kadison determinants, while another uses effective resistance. We use the latter to prove that tree entropy respects stochastic domination. We also prove that tree entropy is non-negative in the unweighted case, a special case of which establishes Lück's Determinant Conjecture for Cayley-graph Laplacians. We use techniques from the theory of operators affiliated to von Neumann algebras.
1985 ◽
Vol 37
(5)
◽
pp. 769-784
◽
Keyword(s):
1969 ◽
Vol 094
(2)
◽
pp. 217-221
◽
2009 ◽
Vol 01
(02)
◽
pp. 153-175
◽
Keyword(s):
2019 ◽
2009 ◽
Vol 08
(05)
◽
pp. 601-615
Keyword(s):