Persistent Combinatorial Model of the Restricted Second Configuration Space of Metric Star Graphs
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 is compatible with the edge-length vector up to isotopy, establishing an equivalence between the associated -parameter persistence modules and . We call the (multi-)filtration a \textit{persistent combinatorial model} of the multifiltration . Using this model, we construct explicit compatible cycle representatives for in the bifiltration obtained by fixing and varying only and .
Cite
@article{arxiv.2603.00914,
title = {Persistent Combinatorial Model of the Restricted Second Configuration Space of Metric Star Graphs},
author = {Wenwen Li and Murad Ozaydin},
journal= {arXiv preprint arXiv:2603.00914},
year = {2026}
}