An information-theoretic, all-scales approach to comparing networks
arXiv:1804.03665 · doi:10.1007/s41109-019-0156-x
Abstract
As network research becomes more sophisticated, it is more common than ever for researchers to find themselves not studying a single network but needing to analyze sets of networks. An important task when working with sets of networks is network comparison, developing a similarity or distance measure between networks so that meaningful comparisons can be drawn. The best means to accomplish this task remains an open area of research. Here we introduce a new measure to compare networks, the Network Portrait Divergence, that is mathematically principled, incorporates the topological characteristics of networks at all structural scales, and is general-purpose and applicable to all types of networks. An important feature of our measure that enables many of its useful properties is that it is based on a graph invariant, the network portrait. We test our measure on both synthetic graphs and real world networks taken from protein interaction data, neuroscience, and computational social science applications. The Network Portrait Divergence reveals important characteristics of multilayer and temporal networks extracted from data.
arXiv comment22 pages (double-spaced), 7 figures
References in corpus (11)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Temporal Networks
- Quantifying social group evolution
- Multirelational Organization of Large-scale Social Networks in an Online World
- Layer aggregation and reducibility of multilayer interconnected networks
- MuxViz: A Tool for Multilayer Analysis and Visualization of Networks
- Collective response of human populations to large-scale emergencies
- A network-based ranking system for American college football
- Portraits of Complex Networks
- Understanding the group dynamics and success of teams
Cited by in corpus (16)
- Topology comparison of Twitter diffusion networks effectively reveals misleading information
- netrd: A library for network reconstruction and graph distances
- Meta-validation of bipartite network projections
- An embedding-based distance for temporal graphs
- A precise bare simulation approach to the minimization of some distances. Foundations
- Detecting periodic time scales in temporal networks
- War pact model of shrinking networks
- Flow of temporal network properties under local aggregation and time shuffling: a tool for characterizing, comparing and classifying temporal networks
- Metrics for network comparison using egonet feature distribution
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- The Infinity Mirror Test for Graph Models
- Higher-order dissimilarity measures for hypergraph comparison
- The Census-Stub Graph Invariant Descriptor
- Machine Learning Guided Multiscale Design of DNA-functionalized Nanoparticles for Targeted Self-Assembly of the Double Gyroid
- Dissimilarity between synchronization processes on networks
- An egonet-based approach to effective weighted network comparison