Publication View

Identities and Inequalities for Tree Entropy (2007)

Abstract
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 and use one of them to prove that tree entropy respects stochastic domination. We also prove that tree entropy is non-negative in the unweighted case.. Comment: 10 pages

Publication details
Download http://arxiv.org/abs/0712.3035
Repository arXiv (United States)
Keywords Mathematics - Combinatorics, Mathematics - Probability, 05C05, 60C05 (Primary) 05C80 (Secondary)
Type text