/Compression-of-Random-Graphs

Functions for information-theoretic graph compression are presented in this repository.

Primary LanguageJupyter Notebook

Compression-of-Random-Graphs

Functions for information-theoretic graph compression are presented in this repository.

Entropy of the Erdos-Renyi(ER) Random Graphs, $\mathcal{G}(n,p)$

The second function is a simple function used to output the binary entropy given a distribution $p$.

The third function generates the value of the entropy of an ER random graph, $\mathcal{G}(n,p)$.