Compressibility of complex networks
Christopher W. Lynn, Danielle S. Bassett

TL;DR
This paper models complex networks as information sources and uses rate-distortion theory to analyze their compressibility, revealing that hierarchical and heterogeneous networks are more amenable to compression.
Contribution
It introduces a novel framework applying rate-distortion theory to quantify network compressibility and identifies structural features that enhance compressibility.
Findings
Compressibility correlates with transitivity and degree heterogeneity.
Hierarchical, modular, and heterogeneous networks are more compressible.
The framework links network structure to information encoding capacity.
Abstract
Many complex networks depend upon biological entities for their preservation. Such entities, from human cognition to evolution, must first encode and then replicate those networks under marked resource constraints. Networks that survive are those that are amenable to constrained encoding, or, in other words, are compressible. But how compressible is a network? And what features make one network more compressible than another? Here we answer these questions by modeling networks as information sources before compressing them using rate-distortion theory. Each network yields a unique rate-distortion curve, which specifies the minimal amount of information that remains at a given scale of description. A natural definition then emerges for the compressibility of a network: the amount of information that can be removed via compression, averaged across all scales. Analyzing an array of real…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Bioinformatics and Genomic Networks · Gene Regulatory Network Analysis
