D. Galvin. (2014)cite arxiv:1406.7872Comment: Notes prepared to accompany a series of tutorial lectures given by the author at the 1st Lake Michigan Workshop on Combinatorics and Graph Theory, Western Michigan University, March 15--16 2014.
Abstract
We explain the notion of the entropy of a discrete random variable, and
derive some of its basic properties. We then show through examples how entropy
can be useful as a combinatorial enumeration tool. We end with a few open
questions.
cite arxiv:1406.7872Comment: Notes prepared to accompany a series of tutorial lectures given by the author at the 1st Lake Michigan Workshop on Combinatorics and Graph Theory, Western Michigan University, March 15--16 2014
%0 Generic
%1 galvin2014three
%A Galvin, David
%D 2014
%K entropy
%T Three tutorial lectures on entropy and counting
%U http://arxiv.org/abs/1406.7872
%X We explain the notion of the entropy of a discrete random variable, and
derive some of its basic properties. We then show through examples how entropy
can be useful as a combinatorial enumeration tool. We end with a few open
questions.
@misc{galvin2014three,
abstract = {We explain the notion of the {\em entropy} of a discrete random variable, and
derive some of its basic properties. We then show through examples how entropy
can be useful as a combinatorial enumeration tool. We end with a few open
questions.},
added-at = {2021-03-29T14:34:30.000+0200},
author = {Galvin, David},
biburl = {https://www.bibsonomy.org/bibtex/217e7909c58ab8ddfe37ca95c224b850e/topel},
interhash = {14094d5a9911bff46f714739930ea874},
intrahash = {17e7909c58ab8ddfe37ca95c224b850e},
keywords = {entropy},
note = {cite arxiv:1406.7872Comment: Notes prepared to accompany a series of tutorial lectures given by the author at the 1st Lake Michigan Workshop on Combinatorics and Graph Theory, Western Michigan University, March 15--16 2014},
timestamp = {2021-03-29T14:34:30.000+0200},
title = {Three tutorial lectures on entropy and counting},
url = {http://arxiv.org/abs/1406.7872},
year = 2014
}