A unified data representation theory for network visualization, ordering and coarse-graining
arXiv:1409.8420 · doi:10.1038/srep13786
Abstract
Representation of large data sets became a key question of many scientific disciplines in the last decade. Several approaches for network visualization, data ordering and coarse-graining accomplished this goal. However, there was no underlying theoretical framework linking these problems. Here we show an elegant, information theoretic data representation approach as a unified solution of network visualization, data ordering and coarse-graining. The optimal representation is the hardest to distinguish from the original data matrix, measured by the relative entropy. The representation of network nodes as probability distributions provides an efficient visualization method and, in one dimension, an ordering of network nodes and edges. Coarse-grained representations of the input network enable both efficient data compression and hierarchical visualization to achieve high quality representations of larger data sets. Our unified data representation theory will help the analysis of extensive data sets, by revealing the large-scale structure of complex networks in a comprehensible form.
13 pages, 5 figures
References in corpus (10)
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Stochastic blockmodels and community structure in networks
- An information-theoretic framework for resolving community structure in complex networks
- Extracting the hierarchical organization of complex systems
- Efficiently inferring community structure in bipartite networks
- Spectral coarse-graining of complex networks
- Network histograms and universality of blockmodel approximation
- Complex networks renormalization: flows and fixed points
- Information content: assessing meso-scale structures in complex networks