In information theory, the graph entropy is a measure of the information rate achievable by communicating symbols over a channel in which certain pairs of values may be confused.^[1] This measure, first introduced by Körner in the 1970s,^[2][3] has since also proven itself useful in other settings, including combinatorics.^[4]

Definition

Let ${\displaystyle G=(V,E)}$ be an undirected graph. The graph entropy of ${\displaystyle G}$, denoted ${\displaystyle H(G)}$ is defined as

${\displaystyle H(G)=\min _{X,Y}I(X;Y)}$

where ${\displaystyle X}$ is chosen uniformly from ${\displaystyle V}$, ${\displaystyle Y}$ ranges over independent sets of G, the joint distribution of ${\displaystyle X}$ and ${\displaystyle Y}$ is such that ${\displaystyle X\in Y}$ with probability one, and ${\displaystyle I(X;Y)}$ is the mutual information of ${\displaystyle X}$ and ${\displaystyle Y}$.^[5]

That is, if we let ${\displaystyle {\mathcal {I}}}$ denote the independent vertex sets in ${\displaystyle G}$, we wish to find the joint distribution ${\displaystyle X,Y}$ on ${\displaystyle V\times {\mathcal {I}}}$ with the lowest mutual information such that (i) the marginal distribution of the first term is uniform and (ii) in samples from the distribution, the second term contains the first term almost surely. The mutual information of ${\displaystyle X}$ and ${\displaystyle Y}$ is then called the entropy of ${\displaystyle G}$.

Properties

• Monotonicity. If ${\displaystyle G_{1}}$ is a subgraph of ${\displaystyle G_{2}}$ on the same vertex set, then ${\displaystyle H(G_{1})\leq H(G_{2})}$.
• Subadditivity. Given two graphs ${\displaystyle G_{1}=(V,E_{1})}$ and ${\displaystyle G_{2}=(V,E_{2})}$ on the same set of vertices, the graph union ${\displaystyle G_{1}\cup G_{2}=(V,E_{1}\cup E_{2})}$ satisfies ${\displaystyle H(G_{1}\cup G_{2})\leq H(G_{1})+H(G_{2})}$.
• Arithmetic mean of disjoint unions. Let ${\displaystyle G_{1},G_{2},\cdots ,G_{k}}$ be a sequence of graphs on disjoint sets of vertices, with ${\displaystyle n_{1},n_{2},\cdots ,n_{k}}$ vertices, respectively. Then ${\displaystyle H(G_{1}\cup G_{2}\cup \cdots G_{k})={\tfrac {1}{\sum _{i=1}^{k}n_{i}}}\sum _{i=1}^{k}{n_{i}H(G_{i})}}$.

Additionally, simple formulas exist for certain families classes of graphs.

• Complete balanced k-partite graphs have entropy ${\displaystyle \log _{2}k}$. In particular,
  • Edge-less graphs have entropy ${\displaystyle 0}$.
  • Complete graphs on ${\displaystyle n}$ vertices have entropy ${\displaystyle \log _{2}n}$.
  • Complete balanced bipartite graphs have entropy ${\displaystyle 1}$.
• Complete bipartite graphs with ${\displaystyle n}$ vertices in one partition and ${\displaystyle m}$ in the other have entropy ${\displaystyle H\left({\frac {n}{m+n}}\right)}$, where ${\displaystyle H}$ is the binary entropy function.

Example

Here, we use properties of graph entropy to provide a simple proof that a complete graph ${\displaystyle G}$ on ${\displaystyle n}$ vertices cannot be expressed as the union of fewer than ${\displaystyle \log _{2}n}$ bipartite graphs.

Proof By monotonicity, no bipartite graph can have graph entropy greater than that of a complete bipartite graph, which is bounded by ${\displaystyle 1}$. Thus, by sub-additivity, the union of ${\displaystyle k}$ bipartite graphs cannot have entropy greater than ${\displaystyle k}$. Now let ${\displaystyle G=(V,E)}$ be a complete graph on ${\displaystyle n}$ vertices. By the properties listed above, ${\displaystyle H(G)=\log _{2}n}$. Therefore, the union of fewer than ${\displaystyle \log _{2}n}$ bipartite graphs cannot have the same entropy as ${\displaystyle G}$, so ${\displaystyle G}$ cannot be expressed as such a union. ${\displaystyle \blacksquare }$

General References

• Matthias Dehmer; Frank Emmert-Streib; Zengqiang Chen; Xueliang Li; Yongtang Shi (25 July 2016). Mathematical Foundations and Applications of Graph Entropy. Wiley. ISBN 978-3-527-69325-2.

Notes