Identities and Inequalities for Tree Entropy

@misc{citeulike:2150800, 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.}, author = {Lyons, Russell }, citeulike-article-id = {2150800}, eprint = {0712.3035}, keywords = {discrete, entropy, graph, spanning-tree, tree}, month = {Dec}, posted-at = {2007-12-20 09:38:47}, priority = {2}, title = {Identities and Inequalities for Tree Entropy}, url = {http://arxiv.org/abs/0712.3035}, year = {2007} }

TY - ELEC ID - citeulike:2150800 L3 - citeulike-article-id:2150800 TI - Identities and Inequalities for Tree Entropy N2 - 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. KW - discrete KW - entropy KW - graph KW - spanning-tree KW - tree AU - Lyons, Russell PY - 2007/Dec/18/ UR - http://arxiv.org/abs/0712.3035 ER -