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)$.

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
BernoulliZip__Lossless_Erdos_Renyi_Graph_Compressor.ipynb		BernoulliZip__Lossless_Erdos_Renyi_Graph_Compressor.ipynb
Entropy of the Erdos-Renyi(ER) Random Graphs (1).ipynb		Entropy of the Erdos-Renyi(ER) Random Graphs (1).ipynb
IntroToGNNs.ipynb		IntroToGNNs.ipynb
README.md		README.md
TMI_based_centralised_TD.ipynb		TMI_based_centralised_TD.ipynb