254 citations · 436 across the 35 of their papers we have counts for
42 papers
A Directed Cubical Framework for k-critical Bipersistence Modules
Robin Belton, Robyn Brooks, Lisbeth Fajstrup +2
In topological data analysis, multiparameter persistence modules (MPMs) are used to analyze data with multiple parameters. Summarizing topological information for MPMs is a non-tri…
Parametric Shortest Paths in a Linearly Interpolated Graph
Jacob Sriraman, Eli Barton, Brittany Terese Fasy +6
We consider the parametric shortest paths problem in a linearly interpolated graph. Given two positively-weighted directed graphs and the linearly…
Too Many or Too Few? Sampling Bounds for Topological Descriptors
Brittany Terese Fasy, Maksym Makarchuk, Samuel Micka +1
Topological descriptors, such as the Euler characteristic function and the persistence diagram, have grown increasingly popular for representing complex data. Recent work showed th…
Tensor Computation of Euler Characteristic Functions and Transforms
Jessi Cisewski-Kehe, Brittany Terese Fasy, Alexander McCleary +1
The weighted Euler characteristic transform (WECT) and Euler characteristic function (ECF) have proven to be useful tools in a variety of applications. However, current methods for…
Drawing Reeb Graphs
Erin Chambers, Brittany Terese Fasy, Erfan Hosseini Sereshgi +1
Reeb graphs are simple topological descriptors with applications in many areas like topological data analysis and computational geometry. Despite their prevalence, visualization of…
Gromov-Hausdorff Distance for Directed Spaces
Lisbeth Fajstrup, Brittany Terese Fasy, Wenwen Li +4
The Gromov-Hausdorff distance measures the similarity between two metric spaces by isometrically embedding them into an ambient metric space. We introduce an analogue of this dista…
Rapid and Precise Topological Comparison with Merge Tree Neural Networks
Yu Qin, Brittany Terese Fasy, Carola Wenk +1
Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due t…
The Manifold Density Function: An Intrinsic Method for the Validation of Manifold Learning
Benjamin Holmgren, Eli Quist, Jordan Schupbach +2
We introduce the manifold density function, which is an intrinsic method to validate manifold learning techniques. Our approach adapts and extends Ripley's -function, and catego…
How Small Can Faithful Sets Be? Ordering Topological Descriptors
Brittany Terese Fasy, David L. Millman, Anna Schenfisch
Recent developments in shape reconstruction and comparison call for the use of many different (topological) descriptor types, such as persistence diagrams and Euler characteristic…
Visualizing Topological Importance: A Class-Driven Approach
Yu Qin, Brittany Terese Fasy, Carola Wenk +1
This paper presents the first approach to visualize the importance of topological features that define classes of data. Topological features, with their ability to abstract the fun…
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy +2
Let be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if is self-overlapping by geometrically constructing a combinatorial word fro…
Metric and Path-Connectedness Properties of the Frechet Distance for Paths and Graphs
Erin Chambers, Brittany Fasy, Benjamin Holmgren +2
The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. M…
The Weighted Euler Characteristic Transform for Image Shape Classification
Jessi Cisewski-Kehe, Brittany Terese Fasy, Dhanush Giriyan +1
The weighted Euler characteristic transform (WECT) is a new tool for extracting shape information from data equipped with a weight function. Image data may benefit from the WECT wh…
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams
Brittany Terese Fasy, Samuel Micka, David L. Millman +2
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in , the (augmented)…
Combinatorial Persistent Homology Transform
Brittany Terese Fasy, Amit Patel
The combinatorial interpretation of the persistence diagram as a Möbius inversion was recently shown to be functorial. We employ this discovery to recast the Persistent Homology Tr…
Differentiating small-scale subhalo distributions in CDM and WDM models using persistent homology
Jessi Cisewski-Kehe, Brittany Terese Fasy, Wojciech Hellwing +3
The spatial distribution of galaxies at sufficiently small scales will encode information about the identity of the dark matter. We develop a novel description of the halo distribu…
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…
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…
A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering
Yu Qin, Brittany Terese Fasy, Carola Wenk +1
Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances betwe…
If You Must Choose Among Your Children, Pick the Right One
Benjamin Holmgren, Bradley McCoy, Brittany Fasy +1
Given a simplicial complex and an injective function from the vertices of to , we consider algorithms that extend to a discrete Morse function on . W…
ANAPT: Additive Noise Analysis for Persistence Thresholding
Audun D. Myers, Firas A. Khasawneh, Brittany T. Fasy
We introduce a novel method for Additive Noise Analysis for Persistence Thresholding (ANAPT) which separates significant features in the sublevel set persistence diagram of a time…
Topological and Geometric Reconstruction of Metric Graphs in
Brittany Terese Fasy, Rafal Komendarczyk, Sushovan Majhi +1
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
A Faithful Discretization of Verbose Directional Transforms
Brittany Terese Fasy, Samuel Micka, David L. Millman +2
The persistent homology transform, Betti function transform, and Euler characteristic transform represent a shape with a multiset of persistence diagrams, Betti functions, or Euler…
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…