Persistence homology of networks: methods and applications
Open accessThe DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Abstract
Information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, and biological networks. The primary challenge in this domain is measuring similarity or distance between networks based on topology. However, classical graph-theoretic measures are usually local and mainly based on differences between either node or edge measurements or correlations without considering the topology of networks such as the connected components or holes. In recent years, mathematical tools and deep learning based methods have become popular to extract the topological features of networks. Persistent homology (PH) is a mathematical tool in computational topology that measures the topological features of data that persist across multiple scales with applications ranging from biological networks to social networks. In this paper, we provide a conceptual review of key advancements in this area of using PH on complex network science. We give a brief mathematical background on PH, review different methods (i.e. filtrations) to define PH on networks and highlight different algorithms and applications where PH is used in solving network mining problems. In doing so, we develop a unified framework to describe these recent approaches and emphasize major conceptual distinctions. We conclude with directions for future work. We focus our review on recent approaches that get significant attention in the mathematics and data mining communities working on network data. We believe our summary of the analysis of PH on networks will provide important insights to researchers in applied network science.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060 · cited 1×
“feature space and then define distances on that space, other methods define kernel functions on graphs to build similarity measures (Vishwanathan et al. 2010).”
Computational topology an introduction
Edelsbrunner, H., & Harer, J. (2010) · Cited by 1,718
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
A (sub)graph isomorphism algorithm for matching large graphs
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.75 · Cited by 1,477 · cited 1×
“graph isomorphism [47]) or some measures of structural similarity (e.”
BackgroundTHIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370
Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., & Borgwardt, K. M. (2010) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,305
Barcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
Network‐based prediction of protein function
Sharan, R., Ulitsky, I., & Shamir, R. (2007) · Molecular Systems Biology · doi:10.1038/msb4100129 · Cited by 1,074
Clustering in weighted networks
Opsahl, T., & Panzarasa, P. (2009) · Social Networks · doi:10.1016/j.socnet.2009.02.002 · Cited by 1,037
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
A survey of graph edit distance
Gao, X., Xiao, B., Tao, D., & Li, X. (2010) · Pattern Analysis and Applications · doi:10.1007/s10044-008-0141-y · Cited by 704
Homological scaffolds of brain functional networks
Petri, G., Expert, P., Turkheimer, F., Carhart-Harris, R., Nutt, D., Hellyer, P. J., & Vaccarino, F. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0873 · Cited by 675
Topological persistence and simplification
Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892133 · Cited by 652 · cited 1×
“be represented via persistence diagram (PD) that consists of the birth and death times of the features as a point (birth, death) in the extended real plane R̄2 [19].”
BackgroundNODE CLASSIFICATION IN SOCIAL NETWORKS
Bhagat, S., Cormode, G., & Muthukrishnan, S. (2011) · Cited by 499
Giusti, C., Ghrist, R., & Bassett, D. S. (2016) · Journal of Computational Neuroscience · doi:10.1007/s10827-016-0608-6 · Cited by 424
Graph isomorphism in quasipolynomial time [extended abstract]
Babai, L. (2016) · Proceedings of the forty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/2897518.2897542 · Cited by 415
Node Classification in Social Networks
Bhagat, S., Cormode, G., & Muthukrishnan, S. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_5 · Cited by 386
Cliques and cavities in the human connectome
Sizemore, A. E., Giusti, C., Kahn, A., Vettel, J. M., Betzel, R. F., & Bassett, D. S. (2018) · Journal of Computational Neuroscience · doi:10.1007/s10827-017-0672-6 · Cited by 372
PERSISTENCE BARCODES FOR SHAPES
CARLSSON, G., ZOMORODIAN, A., COLLINS, A., & GUIBAS, L. J. (2005) · International Journal of Shape Modeling · doi:10.1142/s0218654305000761 · Cited by 287
Graph Isomorphism in Quasipolynomial Time
Babai, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.03547 · Cited by 264
Carlsson, G., & de Silva, V. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9066-0 · Cited by 263
Graph similarity scoring and matching
Zager, L. A., & Verghese, G. C. (2008) · Applied Mathematics Letters · doi:10.1016/j.aml.2007.01.006 · Cited by 224
Persistent homology of complex networks
Horak, D., Maletić, S., & Rajković, M. (2009) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2009/03/p03034 · Cited by 217
Topological Strata of Weighted Complex Networks
Petri, G., Scolamiero, M., Donato, I., & Vaccarino, F. (2013) · PLoS ONE · doi:10.1371/journal.pone.0066506 · Cited by 214
The importance of the whole: Topological data analysis for the network neuroscientist
Sizemore, A. E., Phillips-Cremins, J. E., Ghrist, R., & Bassett, D. S. (2019) · Network Neuroscience · doi:10.1162/netn_a_00073 · Cited by 212 · cited 1×
“In recent years, persistent homology has found applications in data analysis, including neuroscience (Sizemore et al. 2019), time series data (Seversky et al.”
BackgroundOn Time-Series Topological Data Analysis: New Data and Opportunities
Seversky, L. M., Davis, S. R., & Berger, M. (2016) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2016.131 · Cited by 174 · cited 1×
“neuroscience [32], time series data [33], text mining [34] and shape analysis [35].”
BackgroundThe ring of algebraic functions on persistence bar codes
Adcock, A., Carlsson, E., & Carlsson, G. (2016) · Homology Homotopy and Applications · doi:10.4310/hha.2016.v18.n1.a21 · Cited by 145 · cited 1×
“Its applications range from biological systems [13] to computer vision [14].”
BackgroundPatania, A., Vaccarino, F., & Petri, G. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0104-x · Cited by 120
Persistent Homology of Collaboration Networks
Carstens, C. J., & Horadam, K. J. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/815035 · Cited by 100
Collaboration Recommendation on Academic Social Networks
Lopes, G. R., Moro, M. M., Wives, L. K., & de Oliveira, J. P. M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16385-2_24 · Cited by 98 · cited 1×
“Analysis of such networks includes many applications such as node classification [1, 2], community detection [3, 4], and link prediction [5, 6].”
BackgroundPersistent Homology in Sparse Regression and Its Application to Brain Morphometry
Chung, M. K., Hanson, J. L., Ye, J., Davidson, R. J., & Pollak, S. D. (2015) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2015.2416271 · Cited by 91 · cited 1×
“Beside previous weighted networks, brain networks are considered as sparse weighted networks and persistent homology is also used to analyze them (Chung et al. 2015).”
BackgroundTopology Data Analysis of Critical Transitions in Financial Networks
Gidea, M. (2017) · Springer proceedings in complexity · doi:10.1007/978-3-319-55471-6_5 · Cited by 91 · cited 2×
“Table 3: The comparison of algorithms and applications on Multiple Graphs Paper Filtration Topological Summary Data [21, 22] DSS 1 dim PD Brain Networks [64] ZSF 1 dim zigzag PD Brain Networks [62] VR 0 dim Betti plots Brain networks [63] VR 0-1 dim PD Brain networks [67] VR 1 dim PD Brain networks [65] WS 0 dim persi…”
BackgroundMethodClassification of weighted networks through mesoscale homological features
Sizemore, A. E., Giusti, C., & Bassett, D. S. (2016) · Journal of Complex Networks · doi:10.1093/comnet/cnw013 · Cited by 89 · cited 1×
“(Sizemore et al. 2016) extract mesoscale homological features as 0-3 dimensional Betti numbers.”
BackgroundA functorial Dowker theorem and persistent homology of asymmetric networks
Chowdhury, S., & Mémoli, F. (2016) · Journal of Applied and Computational Topology · doi:10.1007/s41468-018-0020-6 · Cited by 87 · cited 4×
“In Chowdhury and Mémoli (2018), the authors define a new way to construct homology on networks: persistent path homology (PPH) which is sensitive to the edge directions.”
BackgroundMethodInfluentialCharacterisation of the Idiotypic Immune Network Through Persistent Entropy
Rucco, M., Castiglione, F., Merelli, E., & Pettini, M. (2016) · Springer proceedings in complexity · doi:10.1007/978-3-319-29228-1_11 · Cited by 80 · cited 2×
“Similar to this, Rucco et al. (2016) use Betti number as persistent entropy to measure the graph complexity. They study the behavior of the idiotypic network of the mammal immune system. Their main goal is to detect the behavior of the immune system reaction to an external stimulus in terms of phase transitions. In ad…”
MethodVisual Detection of Structural Changes in Time-Varying Graphs Using Persistent Homology
Hajij, M., Wang, B., Scheidegger, C., & Rosen, P. (2018) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2018.00024 · Cited by 78 · cited 1×
“In [68], persistent homology is employed to quantify structural changes in timevarying (dynamic) graphs.”
MethodPersistent Homology in Sparse Regression and Its Application to Brain Morphometry
Chung, M. K., Hanson, J. L., Ye, J., Davidson, R. J., & Pollak, S. D. (2014) · Cited by 77
Khalid, A., Kim, B. S., Chung, M. K., Ye, J. C., & Jeon, D. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2014.07.040 · Cited by 73
Persistent Path Homology of Directed Networks
Chowdhury, S., & Mémoli, F. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.75 · Cited by 71 · cited 3×
“13 Digraph filtration using Persistent Path Homology (PPH) In [30], the authors define a new way to construct homology on networks: persistent path homology (PPH) which is sensitive to the edge directions.”
BackgroundMethodExploring uses of persistent homology for statistical analysis of landmark-based shape data
Gamble, J., & Heo, G. (2010) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2010.04.016 · Cited by 68
Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks
Rieck, B., Fugacci, U., Lukasczyk, J., & Leitte, H. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2744321 · Cited by 66
Yoo, J., Kim, E. Y., Ahn, Y. M., & Ye, J. C. (2016) · Journal of Neuroscience Methods · doi:10.1016/j.jneumeth.2016.04.001 · Cited by 55
Binchi, J., Merelli, E., Rucco, M., Petri, G., & Vaccarino, F. (2014) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2014.06.011 · Cited by 54
Computational Topology in Text Mining
Wagner, H., Dłotko, P., & Mrożek, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30238-1_8 · Cited by 40
Comparing Graphs via Persistence Distortion
Dey, T. K., Shi, D., & Wang, Y. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.socg.2015.491 · Cited by 36 · cited 2×
“In (Dey et al. 2015), the authors first introduce the functional metric graph filtration (Functional metric graph filtration (FMG) section) on metric graphs.”
BackgroundGasparovic, E., Gommel, M., Purvine, E., Sazdanović, R., Wang, B., Wang, Y., & Ziegelmeier, L. (2018) · Association for Women in Mathematics series · doi:10.1007/978-3-319-89593-2_3 · Cited by 35
Benzekry, S., Tuszyński, J. A., Rietman, E. A., et al. (2015) · Biology Direct · doi:10.1186/s13062-015-0058-5 · Cited by 33
Stable and Informative Spectral Signatures for Graph Matching
Hu, N., Rustamov, R. M., & Guibas, L. J. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.296 · Cited by 33
Networks and Cycles: A Persistent Homology Approach to Complex Networks
Petri, G., Scolamiero, M., Donato, I., & Vaccarino, F. (2013) · Springer proceedings in complexity · doi:10.1007/978-3-319-00395-5_15 · Cited by 31
Tracing patterns and shapes in remittance and migration networks via persistent homology
Ignacio, P. S., & Darcy, I. K. (2019) · EPJ Data Science · doi:10.1140/epjds/s13688-018-0179-z · Cited by 28
Chung, M. K., Hanson, J. L., Lee, H., Adluru, N., Alexander, A. L., Davidson, R. J., & Pollak, S. D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40811-3_38 · Cited by 28 · cited 1×
“Additionally, in [41], persistent homology is also used to analyze the brain networks with the aim of examining the abnormal white matter in maltreated children.”
BackgroundPersistent homology of directed networks
Chowdhury, S., & Mémoli, F. (2016) · Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.2016.7868997 · Cited by 21 · cited 2×
“Using the idea of the Vietoris-Rips filtration, the authors in [21, 22] define the Dowker”
BackgroundMethodChowdhury, S., Dai, B., & Mémoli, F. (2018) · PLoS ONE · doi:10.1371/journal.pone.0202561 · Cited by 18
Persistent Homology Lower Bounds on High-Order Network Distances
Huang, W., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2620963 · Cited by 17
Probing the geometry of data with diffusion Fréchet functions
Martínez, D. H. D., Lee, C., Kim, P. T., & Mio, W. (2018) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2018.01.003 · Cited by 14 · cited 1×
“Then, they extract the ego-networks of each vertex and define a graph kernel function, namely the diffusion Fréchet function [61], on each ego network that takes both the network topology and edge weights into consideration.”
Comparative Topological Signatures of Growing Collaboration Networks
Pal, S., Moore, T. J., Ramanathan, R., & Swami, A. (2017) · Springer proceedings in complexity · doi:10.1007/978-3-319-54241-6_18 · Cited by 13
Studying the utility preservation in social network anonymization via persistent homology
Gao, T., & Li, F. (2018) · Computers & Security · doi:10.1016/j.cose.2018.04.003 · Cited by 12
Network Embedding: on Compression and Learning
Akbaş, E., & Aktas, M. E. (2019) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata47090.2019.9006142 · Cited by 10 · cited 1×
“Analysis of such networks includes many applications such as node classification (Bhagat et al. 2011; Akbas and Aktas 2019), community detection (Akbas and Zhao 2017a,b), and link prediction (Lopes et al.”
BackgroundSelf-citationResting state dynamic functional connectivity: Network topology analysis
Knyazeva, I., Poyda, A. A., Orlov, V. A., Verkhlyutov, V. M., Makarenko, N., Kozlov, S., Velichkovsky, B. M., & Ushakov, V. (2017) · Biologically Inspired Cognitive Architectures · doi:10.1016/j.bica.2017.10.001 · Cited by 9
Measurement of Nodes Importance for Complex Networks Structural-Holes-Oriented
Xu, H., Zhang, J., Yang, J., & Lun, L. (2016) · Communications in computer and information science · doi:10.1007/978-981-10-2053-7_41 · Cited by 8
Stable Signatures for Dynamic Graphs and Dynamic Metric Spaces via Zigzag PersistencePreprint
Kim, W., & Mémoli, F. (2017) · arXiv (Cornell University) · Cited by 8
Cited by
Learning theories for artificial intelligence promoting learning processes
Gibson, D., Kovanovic, V., Ifenthaler, D., Dexter, S., & Feng, S. (2023) · British Journal of Educational Technology · doi:10.1111/bjet.13341 · Cited by 155
Metadata
- Authors
- Aktas, M. E., Akbas, E., & Fatmaoui, A. E.
- Venue
- Applied Network Science
- Published
- 2019-08-23
- Volume
- 4
- Issue
- 1
- ISSN
- 2364-8228 (ISSN-L)
- OpenAlex
- W2963407101
- Cited by
- 183
- References
- 61
- FWCI
- 6.88
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.