Graph structure similarity using spectral graph theory

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Crawford, B., Gera, R., House, J., Knuth, T., & Miller, R. (2017). Graph structure similarity using spectral graph theory. Studies in Computational Intelligence, 693, 209–221. https://doi.org/10.1007/978-3-319-50901-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free