The igraph software package for complex network research
By Gábor Csárdi, Tamás Nepusz. 2006
12,312 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Sacha Epskamp
- Eiko I. Fried
- D. Hevey
- Denny Borsboom
- A. Cramer
- Alexandre Heeren
- Lourens J. Waldorp
- Damien Farine
Citations in the corpus
- Text Categorization as a Graph Classification Problem (2015, methodology): “We developed our approaches mostly in Python using the igraph library (Csardi and Nepusz, 2006) for the graph representation and main core extraction.”
- 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].”
- MIENTURNET: an interactive web tool for microRNA-target enrichment and network-based analysis (2019, unknown): “1 .2.2) [22], shinyWidgets (ver.”
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization (2012, methodology): “All networks were generated using the igraph package in R [43], [44].”
- Dispersal connectivity and reserve selection for marine conservation (2011, methodology): “Selection of optimal MPA systems We model the optimisation of the MPA network configuration in 4 steps, in R (http://cran.r-project.org/) using the igraph package (Csardi and Nepusz, 2006).”
- Network Analysis of World Trade using the BACI-CEPII Dataset (2014, unknown): “The igraph library (Csardi and Nepusz, 2006), the network library (Butts, 2008a), the sna library (Butts, 2008b), among others, have been collected under the umbrella of the statnet library (Goodreau, Handcock, Hunter, Butts and Morris, 2008), while the tnet library as been realized expressly do…”
- SURFACE: detecting convergent evolution from comparative data by fitting Ornstein‐Uhlenbeck models with stepwise Akaike Information Criterion (2013, methodology): “We then use the function clusters in the igraph package (Csardi & Nepusz 2006) to identify all connected components of this graph: clusters of directly or indirectly connected regimes that are not connected to regimes from any other cluster.”
- SNAP: A General Purpose Network Analysis and Graph Mining Library (2016, methodology): “Other widely used open source network analysis libraries that are similar in functionality to SNAP are NetworkX [Hagberg et al. 2008] and iGraph [Csardi and Nepusz 2006].”
- Complexity of Word Collocation Networks: A Preliminary Structural Analysis (2013, methodology): “In addition to addressing these problems, in this paper we introduce a new analysis - how the global network properties change as we gradually add more collocation edges to a network (Section 4.3).2”