@article{Alharbi_Chambers_Munch_2024, title={Realizable Piecewise Linear Paths of Persistence Diagrams with Reeb Graphs}, volume={3}, url={https://cgt-journal.org/index.php/cgt/article/view/38}, DOI={10.57717/cgt.v3i1.38}, abstractNote={<p>Reeb graphs are widely used in a range of fields for the purposes of analyzing and comparing complex spaces via a simpler combinatorial object. Further, they are closely related to extended persistence diagrams, which largely but not completely encode the information of the Reeb graph. In this paper, we investigate the effect on the persistence diagram of a particular continuous operation on Reeb graphs; namely the (truncated) smoothing operation. This construction arises in the context of the Reeb graph interleaving distance, but separately from that viewpoint provides a simplification of the Reeb graph which continuously shrinks small loops. We then use this characterization to initiate the study of inverse problems for Reeb graphs using smoothing by showing which paths in persistence diagram space (commonly known as vineyards) can be realized by a path in the space of Reeb graphs via these simple operations. This allows us to solve the inverse problem on a certain family of piecewise linear vineyards when fixing an initial Reeb graph. While this particular application is limited in scope, it suggests future directions to more broadly study the inverse problem on Reeb graphs.</p>}, number={1}, journal={Computing in Geometry and Topology}, author={Alharbi, Rehab and Chambers, Erin and Munch, Liz}, year={2024}, month={Jul.}, pages={5:1–5:19} }