REVIEW 6 cited by
igraph enables fast and robust network analysis across programming languages
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Networks or graphs are widely used across the sciences to represent relationships of many kinds. igraph (https://igraph.org) is a general-purpose software library for graph construction, analysis, and visualisation, combining fast and robust performance with a low entry barrier. igraph pairs a fast core written in C with beginner-friendly interfaces in Python, R, and Mathematica. Over the last two decades, igraph has expanded substantially. It now scales to billions of edges, supports Mathematica and interactive plotting, integrates with Jupyter notebooks and other network libraries, includes new graph layouts and community detection algorithms, and has streamlined the documentation with examples and Spanish translations. Modern testing features such as continuous integration, address sanitizers, stricter typing, and memory-managed vectors have also increased robustness. Hundreds of bug reports have been fixed and a community forum has been opened to connect users and developers. Specific effort has been made to broaden use and community participation by women, non-binary people, and other demographic groups typically underrepresented in open source software.
Forward citations
Cited by 6 Pith papers
-
Tournaments determined by three and five voters
Three inducibility conjectures fail: min FAS is always a minimal 3-cycle hitter; α*=2/3 does not imply 3-inducibility; Paley(43) has α*>3/5 yet is not 5-inducible.
-
Improving exponential-family random graph models for bipartite networks
New node-oriented weighted four-cycle statistics for bipartite ERGMs are defined, implemented, and shown in simulation to avoid phase transitions exhibited by existing alternating two-path terms.
-
Physics-Based Molecular Fingerprints from Spectral Graph Theory Provide Efficient Geometry-Aware Measures of Chemical Similarity
A fixed-length, 3D-aware molecular fingerprint based on graph Laplacian eigenvalues separates conformers and stereoisomers and scales to millions of molecules.
-
Scalable Spatial Stream Network (S3N) Models
S3N makes spatial stream-network models scalable by using stream-distance nearest neighbors, enabling whole-basin fish distribution mapping in minutes.
-
Advancing Digital Precision Medicine for Chronic Fatigue Syndrome through Longitudinal Large-Scale Multi-Modal Biological Omics Modeling with Machine Learning and Artificial Intelligence
A multi-task neural network trained on longitudinal multi-omics data reconstructs ME/CFS symptom scores and distinguishes patients from controls with a reported AUC of 0.91, though external validation is weak.
-
Economic Disparities and Their Relationship to Destructive Health Behaviors in Five Western U.S. States
Exploratory analysis of public county data identifies economic variables most correlated with suicide rates in five western states using PCA, clustering, and LASSO.
Discussion (0). Continue with ORCID to comment.