Exploring Network Structure, Dynamics, and Function using NetworkX
By Aric A. Hagberg, Daniel A. Schult, Pieter J. Swart, JM Hagberg. 2008
8,203 citations recorded by the source corpus.
NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self-loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility makes NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for easy exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdos-Renyi, Small World, and Barabasi-Albert models. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.
Subfields: Experimental and Cognitive Psychology, Statistical and Nonlinear Physics, Graph Learning, ML Systems & Hardware, Network Science & Complex Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Experimental and Cognitive Psychology
- Cyrille W. Combettes
- V. Ismatullina
- I. Feklicheva
- Ali Farhadi
- Matthew Brett
- David R. Choffnes
- Jingjing Ren
- T. Chari
In Statistical and Nonlinear Physics
In Graph Learning
- Le Song
- Shuiwang Ji
- Jiliang Tang
- Jure Leskovec
- Rok Sosic
- David M. Beskow
- Alex Smola
- Graham W. Taylor
In ML Systems & Hardware
- J. Vanderplas
- Matthew Newville
- Alex Smola
- Fabian J Theis
- F. Alexander Wolf
- Philipp Angerer
- David L. Woodruff
- Andreas Peter
In Network Science & Complex Systems
- Rok Sosic
- Le Song
- Hanjun Dai
- Jure Leskovec
- Graham W. Taylor
- Boris Knyazev
- Cyrille W. Combettes
- T. Chari
Citations in the corpus
- Array programming with NumPy (2020, methodology): “2) builds on top of this foundation to provide several, widely used technique specific libraries [16, 17, 23], that in turn underlay numerous domain specific projects [24, 25, 26, 27, 28, 29].”
- SciPy 1.0: fundamental algorithms for scientific computing in Python (2019, methodology): “For example, SciPy provides what one expects to find in a statistics textbook (probability distributions, hypothesis tests, frequency statistics, correlation functions, and more), whereas Statsmodels 45 provides more advanced statistical estimators and inference methods, scikit-learn 3 covers machin”
- NAS-Bench-NLP: Neural Architecture Search Benchmark for Natural Language Processing (2020, methodology): “To calculate these values, we used consecutive GED approximations [2] (implemented in NetworkX package [15]) for the limited time.”
- SCANPY: large-scale single-cell gene expression data analysis (2018, methodology): “Moreover, the class provides several functions to compute randomwalk-based metrics that are not available in other graph software [14, 28, 29].”
- Multi-animal pose estimation, identification and tracking with DeepLabCut (2022, methodology): “We construct a directed acyclic graph G = ( V , E ) using NetworkX 47 to describe the affinity between multiple tracklets, where the i th node V i corresponds to the i th tracklet T i , and E is the set of edges encoding the cost entailed by linking the two corresponding tracklets (or, in other word”
- Profit-maximizing parcel locker location problem under threshold Luce model (2020, methodology): “In this paper, we leverage the graph algorithm in the Python package NetworkX (Hagberg et al., 2008) so that we avoid the need for designing the algorithm from scratch.”
- Fast and flexible bacterial genomic epidemiology with PopPUNK (2018, background): “1 (Hagberg et al. 2008) to construct an undirected graph with unweighted edges to define population clusters.”
- OpenPNM: A Pore Network Modeling Package (2016, methodology): “This approach was chosen over a more object oriented approach such as that used by NetworkX [39] because these operations are very fast when vectorized.”
- Topological analysis and interactive visualization of biological networks and protein structures (2012, methodology): “General software libraries for network analysis are the Java framework JUNG 22 , the C + + library LEDA 23 , the Python package NetworkX 24 and R packages such as igraph 25 , statnet 26 , sna 27 , tnet 28 and QuACN 29 .”
- XGNN: Towards Model-Level Explanations of Graph Neural Networks (2020, methodology): “The graphs are obtained using Networkx software package [15].”
- The specious art of single-cell genomics (2021, methodology): “To assess heterogeneity within clusters or relationships between clusters, similarity metrics or distances can be calculated between the cells [33] and displayed with qualitative or quantitative visuals which preserve these metrics, including hierarchical relationship diagrams such as dendrograms an”
- Pattern for Python (2012, background): “The source code is released under a BSD license, so it can be incorporated into proprietary products or used in combination with other open source packages such as SCRAPY (web mining), NLTK (natural language processing), PYBRAIN and PYML (machine learning) and NETWORKX (network analysis).”