On the complexity of graphs (networks) by information content, and\n conditional (mutual) information given other graphs

2020/08/04 by Lloyd Allison, Allison, Lloyd
Chemistry · Computer Science · #92E10 #Computational Drug Discovery Methods #E.4 #FOS: Computer and information sciences #G.3 #History and advancements in chemistry #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2008.04744

openalex publication_date 2020/08/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This report concerns the information content of a graph, optionally\nconditional on one or more background, "common knowledge" graphs. It describes\nan algorithm to estimate this information content, and includes some examples\nbased on chemical compounds.\n

Related

• Structural Information and Dynamical Complexity of Networks
• Estimating mutual information and multi--information in large networks
• Graph Information Ratio
• Identification of complex network topologies through delayed mutual information
• Methods of Information Theory and Algorithmic Complexity for Network Biology