Answers are grounded in this paper and cite their sources.
Graphs are a basic tool in modern data representation. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological constructions can be used to gain information otherwise concealed by the low-dimensional nature of graphs. We do this by extending previous work in homological persistence, and proposing novel graph-theoretical constructions. Beyond cliques, we use independent sets, neighborhoods, enclaveless sets and a Ramsey-inspired extended persistence.
No takes yet. Share an insight, caveat, or question.
Bergomi et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: