activity
20182025
most citedLearning Simplicial Complexes from Persistence Diagrams

11 citations · 13 across the 5 of their papers we have counts for

collaborators

6 papers

math.AT2025

Discrete Level Set Persistence for Finite Discrete Functions

Robin Belton, Georg Essl

We study sublevel set and superlevel set persistent homology on discrete functions through the perspective of finite ordered sets of both linearly ordered and cyclically ordered do…

cs.DS2022

Extremal Event Graphs: A (Stable) Tool for Analyzing Noisy Time Series Data

Robin Belton, Bree Cummins, Brittany Terese Fasy +1

Local maxima and minima, or extremal events, in experimental time series can be used as a coarse summary to characterize data. However, the discrete sampling in recording experimen…

math.AT2021

Combinatorial Conditions for Directed Collapsing

Robin Belton, Robyn Brooks, Stefania Ebli +4

The purpose of this article is to study directed collapsibility of directed Euclidean cubical complexes. One application of this is in the nontrivial task of verifying the executio…

cs.CG2019

Reconstructing Embedded Graphs from Persistence Diagrams

Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz +6

The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides impor…

math.AT2019★ 2 cited

Towards Directed Collapsibility

Robin Belton, Robyn Brooks, Stefania Ebli +5

In the directed setting, the spaces of directed paths between fixed initial and terminal points are the defining feature for distinguishing different directed spaces. The simplest…

cs.CG2018★ 11 cited

Learning Simplicial Complexes from Persistence Diagrams

Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz +6

Topological Data Analysis (TDA) studies the shape of data. A common topological descriptor is the persistence diagram, which encodes topological features in a topological space at…