Fig. 1. Centrality example graph
Fig. 2. Graphs with specific properties
Fig. 3. Centralities of graphs with specific properties
Fig. 4. The process of making a random tree
Fig. 5. calculation of distance using centralities
Fig. 6. Flowchart for calculating distances
Fig. 7. Distances of [Experiment 1]
Fig. 8. Distances of each specific property graphs
Fig. 9. Distances of [Experiment 2]
Table 1. Each vertex centrality in Fig. 1
Table 2. Distance of Fig. 8
Table 3. Similarity with Ring graph
Table 4. Target graph data sets
Table 5. The distances between random graph set
Table 6. Similarity with
참고문헌
- Sanfeliu, Alberto, and King-Sun Fu. "A distance measure between attributed relational graphs for pattern recognition." IEEE transactions on systems, man, and cybernetics 3 (1983): 353-362.
- Pignolet, Yvonne Anne, et al. "The many faces of graph dynamics." Journal of Statistical Mechanics: Theory and Experiment 2017.6 (2017): 063401. https://doi.org/10.1088/1742-5468/aa71ce
- Newman, Mark. Networks. Oxford university press, 2018.
- 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.
- 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.
- Freeman, Linton C. "A set of measures of centrality based on betweenness." Sociometry (1977): 35-41.
- Sabidussi, Gert. "The centrality index of a graph." Psychometrika 31.4 (1966): 581-603. https://doi.org/10.1007/BF02289527
- Havel, Vaclav. "A remark on the existence of finite graphs." Casopis Pest. Mat. 80 (1955): 477-480.
- Ronqui, Jose Ricardo Furlan, and Gonzalo Travieso. "Analyzing complex networks through correlations in centrality measurements." Journal of Statistical Mechanics: Theory and Experiment 2015.5 (2015): P05030. https://doi.org/10.1088/1742-5468/2015/05/P05030
- ERDdS, P., and A. R&WI. "On random graphs I." Publ. Math. Debrecen 6 (1959): 290-297.
- Albert, Reka, and Albert-Laszlo Barabasi. "Statistical mechanics of complex networks." Reviews of modern physics 74.1 (2002): 47. https://doi.org/10.1103/RevModPhys.74.47
- Erdos, Paul, and Alfred Renyi. "Asymmetric graphs." Acta Mathematica Academiae Scientiarum Hungarica 14.3-4 (1963): 295-315. https://doi.org/10.1007/BF01895716
- Prufer, H. (1918). "Neuer Beweis eines Satzes über Permutationen". Arch. Math. Phys. 27: 742-744.
- Newman, Mark EJ, and Michelle Girvan. "Finding and evaluating community structure in networks." Physical review E 69.2 (2004): 026113. https://doi.org/10.1103/PhysRevE.69.026113
- Lusseau, David. "The emergent properties of a dolphin social network." Proceedings of the Royal Society of London B: Biological Sciences 270.Suppl 2 (2003): S186-S188.
- Watts, Duncan J., and Steven H. Strogatz. "Collective dynamics of 'small-world'networks." nature 393.6684 (1998): 440. https://doi.org/10.1038/30918