netrd: A library for network reconstruction and graph distances

Over the last two decades, alongside the increased availability of large network datasets, we have witnessed the rapid rise of network science. For many systems, however, the data we have access to is not a direct description of the underlying network. More and more, we see the drive to study networks that have been inferred or reconstructed from non-network data---in particular, using time series data from the nodes in a system to infer likely connections between them. Selecting the most appropriate technique for this task is a challenging problem in network science. Different reconstruction techniques usually have different assumptions, and their performance varies from system to system in the real world. One way around this problem could be to use several different reconstruction techniques and compare the resulting networks. However, network comparison is also not an easy problem, as it is not obvious how best to quantify the differences between two networks, in part because of the diversity of tools for doing so. The netrd Python package seeks to address these two parallel problems in network science by providing, to our knowledge, the most extensive collection of both network reconstruction techniques and network comparison techniques (often referred to as graph distances) in a single library (this https URL). In this article, we detail the two main functionalities of the netrd package. Along the way, we describe some of its other useful features. This package builds on commonly used Python packages and is already a widely used resource for network scientists and other multidisciplinary researchers. With ongoing open-source development, we see this as a tool that will continue to be used by all sorts of researchers to come.

[1]  A. Edelman,et al.  Random matrix theory , 2005, Acta Numerica.

[2]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[3]  Danai Koutra,et al.  DELTACON: A Principled Massive-Graph Similarity Function , 2013, SDM.

[4]  Joseph T. Lizier,et al.  JIDT: An Information-Theoretic Toolkit for Studying the Dynamics of Complex Systems , 2014, Front. Robot. AI.

[5]  Joshua T. Vogelstein,et al.  A Bayesian approach for inferring neuronal connectivity from calcium fluorescent imaging data , 2011, 1107.4228.

[6]  Alexander S Mikhailov,et al.  Evolutionary reconstruction of networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  J Runge,et al.  Causal network reconstruction from time series: From theoretical assumptions to practical estimation. , 2018, Chaos.

[8]  Ulrik Brandes,et al.  What is network science? , 2013, Network Science.

[9]  Manlio De Domenico,et al.  Spectral entropies as information-theoretic tools for complex network comparison , 2016, 1609.01214.

[10]  Joel Nothman,et al.  SciPy 1.0-Fundamental Algorithms for Scientific Computing in Python , 2019, ArXiv.

[11]  Norbert Marwan,et al.  The backbone of the climate network , 2009, 1002.2100.

[12]  François G. Meyer,et al.  The Resistance Perturbation Distance: A Metric for the Analysis of Dynamic Networks , 2016, Discret. Appl. Math..

[13]  James P. Bagrow,et al.  An information-theoretic, all-scales approach to comparing networks , 2018, Applied Network Science.

[14]  David K. Hammond,et al.  Graph diffusion distance: A difference measure for weighted graphs based on the graph Laplacian exponential kernel , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[15]  T. S. Evans,et al.  Complex networks , 2004 .

[16]  Cesare Furlanello,et al.  An introduction to spectral distances in networks , 2010, WIRN.

[17]  Angelo Bifone,et al.  Complexity in Neural and Financial Systems: From Time-Series to Networks , 2018, Complex..

[18]  Emmanuel Müller,et al.  NetLSD: Hearing the Shape of a Graph , 2018, KDD.

[19]  R. Tibshirani,et al.  Sparse inverse covariance estimation with the graphical lasso. , 2008, Biostatistics.

[20]  George Sugihara,et al.  Detecting Causality in Complex Ecosystems , 2012, Science.

[21]  Ji Liu,et al.  Extracting neuronal functional network dynamics via adaptive Granger causality analysis , 2018, Proceedings of the National Academy of Sciences.

[22]  Panos M. Pardalos,et al.  Quantification of network structural dissimilarities , 2017, Nature Communications.

[23]  Dino Sejdinovic,et al.  Detecting and quantifying causal associations in large nonlinear time series datasets , 2017, Science Advances.

[24]  P. Barucca Localization in covariance matrices of coupled heterogenous Ornstein-Uhlenbeck processes. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Olivier Ledoit,et al.  Honey, I Shrunk the Sample Covariance Matrix , 2003 .

[26]  Dan Chen,et al.  Complex network comparison based on communicability sequence entropy. , 2018, Physical review. E.

[27]  Albert-Lszl Barabsi,et al.  Network Science , 2016, Encyclopedia of Big Data.

[28]  Tiago P. Peixoto Network Reconstruction and Community Detection from Dynamics , 2019, Physical review letters.

[29]  K. Jarrod Millman,et al.  Array programming with NumPy , 2020, Nat..

[30]  Cesare Furlanello,et al.  The HIM glocal metric and kernel for network comparison and classification , 2012, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[31]  Danai Koutra,et al.  NetSimile: A Scalable Approach to Size-Independent Network Similarity , 2012, ArXiv.

[32]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[33]  Tanya Y. Berger-Wolf,et al.  Network Structure Inference, A Survey , 2016, ACM Comput. Surv..

[34]  Theo Geisel,et al.  Model-Free Reconstruction of Excitatory Neuronal Connectivity from Calcium Imaging Signals , 2012, PLoS Comput. Biol..

[35]  Martín Gómez Ravetti,et al.  Analyzing complex networks evolution through Information Theory quantifiers , 2011 .

[36]  Tina Eliassi-Rad,et al.  Non-backtracking cycles: length spectrum theory and graph mining applications , 2019, Appl. Netw. Sci..

[37]  Erik Aurell,et al.  Maximum likelihood reconstruction for Ising models with asynchronous updates. , 2013, Physical review letters.

[38]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[39]  Brennan Klein,et al.  Network comparison and the within-ensemble graph distance , 2020, Proceedings of the Royal Society A.

[40]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[41]  Junghyo Jo,et al.  Network inference in stochastic systems from neurons to currencies: Improved performance at small sample size. , 2019, Physical review. E.

[42]  Andrew Mellor,et al.  Graph Comparison via the Non-backtracking Spectrum , 2018, Physical review. E.

[43]  S. Holmes,et al.  Tracking network dynamics: A survey using graph distances , 2018, The Annals of Applied Statistics.