An information-theoretic, all-scales approach to comparing networks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2; 2025: 2.
7 papers.
- 2024Challenges of Generating Structurally Diverse Graphscited by 6
- 2022Multiscale Graph Comparison via the Embedded Laplacian Discrepancycited by 5
- 2021Graph Similarity Description: How Are These Graphs Similar?cited by 3
- 2024An embedding-based distance for temporal graphscited by 3
- 2023Dynamic Vertex Replacement Grammarscited by 0
- 2025Visualization Tasks for Unlabeled Graphscited by 0
- 2025A Framework Based on Graph Cellular Automata for Similarity Evaluation in Urban Spatial Networkscited by 0
- 2025A Framework Based on Graph Cellular Automata for Similarity Evaluation in Urban Spatial Networks2 Nov 2025
- 2025Visualization Tasks for Unlabeled Graphs19 Apr 2025
- 2024Challenges of Generating Structurally Diverse Graphs27 Sep 2024
- 2024An embedding-based distance for temporal graphs23 Jan 2024
- 2023Dynamic Vertex Replacement Grammars21 Mar 2023
- 2022Multiscale Graph Comparison via the Embedded Laplacian Discrepancy28 Jan 2022
- 2021Graph Similarity Description: How Are These Graphs Similar?29 May 2021