netrd: A library for network reconstruction and graph distances

Abstract

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 (https://github.com/netsiphd/netrd). 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.

References in corpus (19)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Array Programming with NumPy
• Detecting causal associations in large nonlinear time series datasets
• The backbone of the climate network
• JIDT: An information-theoretic toolkit for studying the dynamics of complex systems
• Model-free reconstruction of neuronal network connectivity from calcium imaging signals
• Spectral entropies as information-theoretic tools for complex network comparison
• Network reconstruction and community detection from dynamics
• NetLSD: Hearing the Shape of a Graph
• DELTACON: A Principled Massive-Graph Similarity Function
• A Bayesian approach for inferring neuronal connectivity from calcium fluorescent imaging data
• Evolutionary reconstruction of networks
• An information-theoretic, all-scales approach to comparing networks
• NetSimile: A Scalable Approach to Size-Independent Network Similarity
• Maximum likelihood reconstruction for Ising models with asynchronous updates
• Network comparison and the within-ensemble graph distance
• Graph Comparison via the Non-backtracking Spectrum
• Causality inference in stochastic systems from neurons to currencies: Profiting from small sample size
• Localization in covariance matrices of coupled heterogenous Ornstein-Uhlenbeck processes

Cited by in corpus (6)

• Network comparison and the within-ensemble graph distance
• Multilayer patent citation networks: A comprehensive analytical framework for studying explicit technological relationships
• Inferring Network Structure with Unobservable Nodes from Time Series Data
• Duality between predictability and reconstructability in complex systems
• Higher-order dissimilarity measures for hypergraph comparison
• Inferring, comparing and exploring ecological networks from time-series data through R packages constructnet, disgraph and dynet