CliqueTop is a collection of matlab scripts for doing topological analysis of symmetric matrices. The syntax for using the package is: ompute_clique_topology(A) for any symmetric matrix A. Options and details can be found in the documentation for the compute_clique_topology function. CliqueTop currently relies on the following software packages, which are included in this repository for convenience and should function automatically without installation: For persistent homology computations, we make use of Perseus by Vidit Nanda. As of this writing, the current version can be found at vnanda/perseus/index.html. We recommend using the snapshot provided in this repository, as the input/output format for Perseus may change in the future. Cliquer, for the clique splitting version of the clique enumeration algorithm, a C package by Sampo Niskanen and Patric R. J. Östergård, available at pat/cliquer.html. The code was written by Chad Giusti, and the underlying ideas are the result of joint work with Vladimir Itskov and Carina Curto. The work was supported by NSF DMS-1122519. More details can be found in Giusti, Pastalkova, Curto and Itskov, ”Clique topology reveals instrinsic geometric structure in neural correlations.” (arXiv:1502.06172 [q-bio.NC] and arXiv:1502.06173 [q-bio.NC])

References in zbMATH (referenced in 24 articles , 1 standard article )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Kališnik, Sara; Lehn, Christian; Limic, Vlada: Geometric and probabilistic limit theorems in topological data analysis (2021)
  2. Kim, Woojin; Mémoli, Facundo: Spatiotemporal persistent homology for dynamic metric spaces (2021)
  3. Torres, Leo; Blevins, Ann S.; Bassett, Danielle; Eliassi-Rad, Tina: The why, how, and when of representations for complex systems (2021)
  4. Battiston, Federico; Cencetti, Giulia; Iacopini, Iacopo; Latora, Vito; Lucas, Maxime; Patania, Alice; Young, Jean-Gabriel; Petri, Giovanni: Networks beyond pairwise interactions: structure and dynamics (2020)
  5. Belton, Robin Lynne; Fasy, Brittany Terese; Mertz, Rostik; Micka, Samuel; Millman, David L.; Salinas, Daniel; Schenfisch, Anna; Schupbach, Jordan; Williams, Lucia: Reconstructing embedded graphs from persistence diagrams (2020)
  6. Bergomi, Mattia G.; Ferri, Massimo; Zuffi, Lorenzo: Topological graph persistence (2020)
  7. Bubenik, Peter; Hull, Michael; Patel, Dhruv; Whittle, Benjamin: Persistent homology detects curvature (2020)
  8. Grange, Pascal: Topology of the mesoscale connectome of the mouse brain (2020)
  9. Hernández Serrano, Daniel; Sánchez Gómez, Darío: Centrality measures in simplicial complexes: applications of topological data analysis to network science (2020)
  10. Jaquette, Jonathan; Schweinhart, Benjamin: Fractal dimension estimation with persistent homology: a comparative study (2020)
  11. Naitzat, Gregory; Zhitnikov, Andrey; Lim, Lek-Heng: Topology of deep neural networks (2020)
  12. Nie, Chun-Xiao: Nonlinear correlation analysis of time series based on complex network similarity (2020)
  13. Schaub, Michael T.; Benson, Austin R.; Horn, Paul; Lippner, Gabor; Jadbabaie, Ali: Random walks on simplicial complexes and the normalized Hodge 1-Laplacian (2020)
  14. Wang, Dong; Zhao, Yi; Leng, Hui; Small, Michael: A social communication model based on simplicial complexes (2020)
  15. Ding, Li; Hu, Ping: Contagion processes on time-varying networks with homophily-driven group interactions (2019)
  16. Monod, Anthea; Kališnik, Sara; Patiño-Galindo, Juan Ángel; Crawford, Lorin: Tropical sufficient statistics for persistent homology (2019)
  17. Rybakken, Erik; Baas, Nils; Dunn, Benjamin: Decoding of neural data using cohomological feature extraction (2019)
  18. Buchet, Mickaël; Escolar, Emerson G.: Realizations of indecomposable persistence modules of arbitrarily large dimension (2018)
  19. Chowdhury, Samir; Mémoli, Facundo: A functorial Dowker theorem and persistent homology of asymmetric networks (2018)
  20. Mulder, Daan; Bianconi, Ginestra: Network geometry and complexity (2018)

1 2 next