Comparing methods for comparing networks

Abstract

With the impressive growth of available data and the flexibility of network modelling, the problem of devising effective quantitative methods for the comparison of networks arises. Plenty of such methods have been designed to accomplish this task: most of them deal with undirected and unweighted networks only, but a few are capable of handling directed and/or weighted networks too, thus properly exploiting richer information. In this work, we contribute to the effort of comparing the different methods for comparing networks and providing a guide for the selection of an appropriate one. First, we review and classify a collection of network comparison methods, highlighting the criteria they are based on and their advantages and drawbacks. The set includes methods requiring known node-correspondence, such as DeltaCon and Cut Distance, as well as methods not requiring a priori known node-correspondence, such as alignment-based, graphlet-based, and spectral methods, and the recently proposed Portrait Divergence and NetLSD. We test the above methods on synthetic networks and we assess their usability and the meaningfulness of the results they provide. Finally, we apply the methods to two real-world datasets, the European Air Transportation Network and the FAO Trade Network, in order to discuss the results that can be drawn from this type of analysis.

Potential energy of complex networks: a quantum mechanical perspective

“…In particular, the degeneracy of the lowest eigenvalue of the graph Laplacian associated with the network is equal to the number of its connected components 10 . Results in this field encourage the research of spectrum-based frameworks to capture similar patterns in networks of various nature 11 , following a recent tendency to explore several tools for network comparison 12 – 14 . Several applications can be envisaged, ranging from the possibility to characterize different information patterns 15 to the reduction of the structure and complexity of biological, transportation, and social multiplex networks 16 – 18 .…”

Molecular networks in Network Medicine: Development and applications

“…From this perspective, meta‐analyses can have the capability to increase statistical power and generalizability of single‐study analysis (B. Chen & Butte, 2013; Wolkenhauer, Auffray, Jaster, Steinhoff, & Dammann, 2013; Wolkenhauer et al, 2009). Comparing different networks is a challenging task when nodes can differ between networks (recently reviewed by Tantardini, Ieva, Tajoli, and Piccardi (2019)), which can be addressed with approaches based on graphlets, spectral methods, and portrait divergence.…”

Network Analysis to Identify Communities Among Multiple Exposure Biomarkers Measured at Birth in Three Flemish General Population Samples

“…When the number of biomarkers in the dataset increases, the interpretation of weighted networks is likely to become more challenging, although community detection will facilitate interpretation to a great deal. Also, CNA of weighted networks will become more challenging, for example inexact graph matching where networks are assessed as equal within certain criteria ( 32 ), or where the most important nodes and/or edges are extracted ( 40 ).…”

“…Networks can be compared on their similarities or their dissimilarities. Multiple network comparison methods have been described before, and some can be computationally challenging ( 9 , 32 ). In this paper, we focus on exact graph matching, which involves the exact correspondence between two or more graphs with the exact same set of nodes.…”