Abstract
In understanding an unknown network we search for metrics to determine how close an inferred network that is being analyzed, is to the truth. We develop a metric to test for similarity between an inferred network and the true network. Our method uses the eigenvalues of the adjacency matrix and of the Laplacian at each step of the network discovery to decide on the comparison to the ground truth. We consider synthetic networks and real terrorist networks for our analysis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aliakbary, S., Motallebi, S., Rashidian, S., Habibi, J., Movaghar, A.: Distance metric learning for complex networks: Towards size-independent comparison of network structures. Chaos: An Interdisciplinary Journal of Nonlinear Science 25(2), 023,111 (2015)
Chartrand, G., Zhang, P.: A first course in graph theory. Courier Corporation (2012)
Chung, F.R.: Spectral graph theory, vol. 92. American Mathematical Soc. (1997)
Cunningham, D.: The boko haram network. [machine-readable data file]. https://sites.google.com/site/sfeverton18/research/appendix-1 (2014)
Cunningham, D., Everton, S., Wilson, G., Padilla, C., Zimmerman, D.: Brokers and key players in the internationalization of the farc. Studies in Conflict & Terrorism 36(6), 477–502 (2013)
Davis, B., Gera, R., Lazzaro, G., Lim, B.Y., Rye, E.C.: The marginal benefit of monitor placement on networks. In: Complex Networks VII, pp. 93–104. Springer (2016)
Frankl, P., Rödl, V.: Forbidden intersections. Transactions of the American Mathematical Society 300(1), 259–286 (1987)
Gera, R.: Network Discovery Visualization Project: Naval Postgraduate School network discovery visualization project. http://faculty.nps.edu/dl/networkVisualization/ (2015)
Kashima, H., Inokuchi, A.: Kernels for graph classification. In: ICDM Workshop on Active Mining, vol. 2002. Citeseer (2002)
Klir, G., Elias, D.: Architecture of systems problem solving. 2nd edn., ifsr international series on systems science and engineering, vol. 21 (2003)
Koutra, D., Vogelstein, J.T., Faloutsos, C.: Deltacon: A principled massive-graph similarity function
Mihail, M., Papadimitriou, C.: On the eigenvalue power law. In: Randomization and approximation techniques in computer science, pp. 254–262. Springer (2002)
Pržulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177–e183 (2007)
Roberts, N., Everton., S.F.: Terrorist data: Noordin top terrorist network (subset). [machinereadable data file]. https://sites.google.com/site/sfeverton18/research/appendix-1 (2011)
Ruth, D.M., Koyak, R.A.: Nonparametric tests for homogeneity based on non-bipartite matching. Journal of the American Statistical Association 106(496) (2011)
Schmitt, K.: Fake degree discovery algorithm for lighting up networks. https://github.com/Pelonza/Graph Inference/blob/master (2015)
Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 737–746. ACM (2007)
Trefethen, L.N., Bau III, D.: Numerical linear algebra, vol. 50. Siam (1997)
Wilson, R.C., Zhu, P.: A study of graph spectra for comparing graphs and trees. Pattern Recognition 41(9), 2833–2841 (2008)
Zager, L.A., Verghese, G.C.: Graph similarity scoring and matching. Applied mathematics letters 21(1), 86–94 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Crawford, B., Gera, R., House, J., Knuth, T., Miller, R. (2017). Graph Structure Similarity using Spectral Graph Theory. In: Cherifi, H., Gaito, S., Quattrociocchi, W., Sala, A. (eds) Complex Networks & Their Applications V. COMPLEX NETWORKS 2016 2016. Studies in Computational Intelligence, vol 693. Springer, Cham. https://doi.org/10.1007/978-3-319-50901-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-50901-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50900-6
Online ISBN: 978-3-319-50901-3
eBook Packages: EngineeringEngineering (R0)