Beyond topological persistence: Starting from networks
Combinatorics
2020-09-16 v2 Category Theory
Abstract
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to significant data types as simple graphs and quivers. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness such as clique communities, -vertex and -edge connectedness directly on simple graphs and monic coherent categories.
Cite
@article{arxiv.1901.08051,
title = {Beyond topological persistence: Starting from networks},
author = {Mattia G. Bergomi and Massimo Ferri and Pietro Vertechi and Lorenzo Zuffi},
journal= {arXiv preprint arXiv:1901.08051},
year = {2020}
}
Comments
arXiv admin note: text overlap with arXiv:1707.09670