On efficient network similarity measures

Matthias Dehmer, Zengqiang Chen, Yongtang Shi, Yusen Zhang, Shailesh Tripathi, Modjtaba Ghorbani, Abbe Mowshowitz and Frank Emmert-Streib

Applied Mathematics and Computation, 2019, vol. 362, issue C, -

Abstract: This paper presents novel graph similarity measures which can be applied to simple directed and undirected networks. To define the graph similarity measures, we first map graphs to real numbers by utilizing structural graph measures. Then, we define measures of similarity between real numbers and prove that they can be used as proxies for graph similarity. Numerical results are derived to show the domain coverage of these measures as well as their clustering ability. The latter relates to the efficient grouping of graphs according to certain structural properties. Our numerical results are sensitive to these properties and offer insights useful for designing effective graph similarity measures.

Keywords: Distance measures; Similarity measures; Inequalities; Graphs; Networks (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305004
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:362:y:2019:i:c:23

DOI: 10.1016/j.amc.2019.06.035

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().