In this paper, a method to measure similarity between two graphs is proposed, which is based on centralities of the graphs. The similarity between two graphs G₁ and G₂ is defined by the difference of distance( G₁ , GR1 ) and distance(G₂ ,GR2 ), where GR1 and GR2 are set of random graphs that have the same number of nodes and edges as G₁ and G₂ , respectively. Each distance (G* , GR+ ) is obtained by comparing centralities of G* and GR+ . Through the computational experiments, we show that it is possible to compare graphs regardless of the number of vertices or edges of the graphs. Also, it is possible to identify and classify the properties of the graphs by measuring and comparing similarities between two graphs.
A distance measure between attributed relational graphs for pattern recognition
미소장
2
The many faces of graph dynamics
미소장
3
Newman, Mark. Networks. Oxford university press, 2018.
미소장
4
Roy, Matthieu, Stefan Schmid, and Gilles Tredan. "Modeling and measuring graph similarity: The case for centrality distance." Proceedings of the 10th ACM international workshop on Foundations of mobile computing. ACM, 2014.
미소장
5
Mheich, A., et al. "A novel algorithm for measuring graph similarity: application to brain networks." Neural Engineering (NER), 2015 7th International IEEE/EMBS Conference on. IEEE, 2015.
미소장
6
A Set of Measures of Centrality Based on Betweenness
미소장
7
The centrality index of a graph
미소장
8
Havel, Václav. "A remark on the existence of finite graphs." Casopis Pest. Mat. 80 (1955): 477-480.
미소장
9
Analyzing complex networks through correlations in centrality measurements
미소장
10
ERDdS, P., and A. R&WI. "On random graphs I." Publ. Math. Debrecen 6 (1959): 290-297.
미소장
11
Statistical mechanics of complex networks
미소장
12
Asymmetric graphs
미소장
13
Prüfer, H. (1918). "Neuer Beweis eines Satzes über Permutationen". Arch. Math. Phys. 27: 742–744.
미소장
14
Finding and evaluating community structure in networks.
미소장
15
The Emergent Properties of a Dolphin Social Network