Persistent Combinatorial Model of the Restricted Second Configuration Space of Metric Star Graphs
Wenwen Li, Murad Ozaydin

TL;DR
This paper develops a combinatorial graph-based model to analyze the persistent homology of the configuration space of metric star graphs, providing explicit cycle representatives and establishing isomorphisms between different filtrations.
Contribution
It introduces a persistent combinatorial model that simplifies the study of the second configuration space of metric star graphs and constructs explicit cycle representatives.
Findings
Constructed a bipartite weighted graph model $(G_k)_{L}$ for the configuration space.
Proved the model's filtration is isomorphic to the configuration space filtration.
Explicitly constructed compatible cycle representatives for the first homology.
Abstract
In this work, we present explicit constructions and computations of representative cycles for a nontrivial 2-parameter persistence module arising from the configuration space of metric star graphs. For all edge-length vector , we construct a bipartite weighted graph and define filtering functions on the set of vertices and set of edges of to obtain a filtration (denoted by ) consisting of geometric realization of subgraphs of . We show that such a filtration is naturally isomorphic to the filtration of the restricted second configuration space of metric star graphs concerning the restraint parameter and an (arbitrary but fixed) edge-length vector . Additionally, we show that the filtration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
