2020
DOI: 10.1371/journal.pone.0228728
|View full text |Cite
|
Sign up to set email alerts
|

Metrics for graph comparison: A practitioner’s guide

Abstract: Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others. Discovery and comparison of structures such as modular communities, rich clubs, hubs, and trees yield insight into the generative mechanisms and functional properties of the graph. Often, two graphs are compared via a pairwise distance measure, with a small distance indicating structural sim… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
68
0
4

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 112 publications
(81 citation statements)
references
References 86 publications
(127 reference statements)
1
68
0
4
Order By: Relevance
“…In the following we approach this question by methods of spectral graph theory (Gu et al. 2016 ; Wilson and Zhu 2008 ; Wills and Meyer 2020 ), adding to the applications of spectral analysis of evolutionary graphs (Richter 2017 , 2019a , b , 2020 ; Allen et al. 2019 ).…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…In the following we approach this question by methods of spectral graph theory (Gu et al. 2016 ; Wilson and Zhu 2008 ; Wills and Meyer 2020 ), adding to the applications of spectral analysis of evolutionary graphs (Richter 2017 , 2019a , b , 2020 ; Allen et al. 2019 ).…”
Section: Resultsmentioning
confidence: 99%
“…The principal quantity for assessing structural properties of the graph is the spectral gap (Hoffman et al. 2019 ; Wilson and Zhu 2008 ; Wills and Meyer 2020 ). Figure 6 gives the spectral gap over for the quartic graphs of order and the cubic graphs with as a scatter plot, for results of the remaining graphs, see the Appendix, Fig.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…To test whether global network reorganization took place after overlearning, the distance measures 'edit distance' and 'Deltacon' were calculated. Edit distance computes additions or deletions of connections between two graphs 129 . The edit distance matrix was defined as:…”
Section: Networkmentioning
confidence: 99%
“…Where A and A' are the adjacency matrices for graphs G (session one) and G' (session two) respectively, and is the pairwise edit distance 129 . Since session one and two shared node identity, this pairwise application was applicable.…”
Section: Networkmentioning
confidence: 99%