Abstract
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and \textit{ranging} sets: two standardized ways of producing persistence diagrams directly from graph-theoretical features. The two constructions are framed in the context of \textit{indexing-aware persistence functions}. Furthermore, we introduce a sufficient condition for stability. Finally, we apply the steady- and ranging-based persistence constructions to toy examples and real-world applications.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.