Steady and ranging sets in graph persistence

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 steady and ranging sets: two standardized ways of producing persistence diagrams directly from graph-theoretical features. The two constructions are framed in the context of 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.