Graph entropy: Difference between revisions

Revision as of 12:18, 16 November 2016

Revision as of 13:09, 23 December 2016

Line 6:

::<math>H(G) = \min_{X,Y} I(X ; Y)</math>

where <math>X</math> is chosen [[Uniform distribution|uniformly]] from <math>V</math>, <math>Y</math> is an [[independent set]]{{dn|date=December 2016}} in G, and <math>I(X ; Y)</math> is the [[mutual information]] of <math>X</math> and <math>Y</math>.

==Properties==