2018
DOI: 10.21105/joss.00925
|View full text |Cite
|
Sign up to set email alerts
|

Ripser.py: A Lean Persistent Homology Library for Python

Abstract: Topological data analysis (TDA) (Edelsbrunner & Harer, 2010), (Carlsson, 2009) is a field focused on understanding the shape and structure of data by computing topological descriptors that summarize features as connected components, loops, and voids. TDA has found wide applications across nonlinear time series analysis (

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
125
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 174 publications
(125 citation statements)
references
References 11 publications
0
125
0
Order By: Relevance
“…In our work, we use Ripser.py [ 76 ] due to its speed and efficiency for the computation of persistent homology for the empirical networks and the null models.…”
Section: Methodsmentioning
confidence: 99%
“…In our work, we use Ripser.py [ 76 ] due to its speed and efficiency for the computation of persistent homology for the empirical networks and the null models.…”
Section: Methodsmentioning
confidence: 99%
“…Non-parametric statistics were chosen due to the uncertainty that the data were sufficiently Gaussian. Persistence homology analysis was done using the Ripser (version 0.3.2) [58] and Persim libraries (version 0.0.9) as part of the Scikit-TDA library (version 0.0.4) [53]. Other packages used include the Numpy library (version [21], iGraph (version 0.7.1) [14].…”
Section: Softwarementioning
confidence: 99%
“…Persistent homology was computed using version 0.4.1 of the Ripser package as bundled with the Scikit-TDA toolbox for python [62]. Because the computational load to calculate persistence homology increases exponentially with the homology dimension, we limit the present study to the investigation of persistence homology in dimensions 0, 1, and 2.…”
Section: Homological Graph-graph Distancementioning
confidence: 99%