Gregory Henselman-Petrusek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gregory Henselman-Petrusek has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Alyson Bittner
Pacific Northwest National Laboratory Richland Seattle WA United States
1 shared publication - Audun Myers
Pacific Northwest National Laboratory, Richland, USA
1 shared publication Bill Kay
Pacific Northwest National Laboratory Richland Seattle WA United States
1 shared publication- Christian Lentz
Tufts University Medford MA
1 shared publication - Cliff Joslyn
Pacific Northwest National Laboratory
1 shared publication - Daniel M. Best
Pacific Northwest National Laboratory Richland Seattle WA United States
1 shared publication
Latest Publications
- Open Access
A U-match Algorithm for Persistent Relative Homology
A central problem in data-driven scientific inquiry is how to interpret structure in noisy, high-dimensional data. Topological data analysis (TDA) provides a solution via persistent homology, which encodes features of interest as topological holes within a filtration of data. The present work extends this framework to a related invariant which uncovers topological structure of a space relative to a subspace: persistent relative homology (PRH). We show that this invariant can be computed in a simple, highly transparent and general manner, using a two-step matrix reduction technique with worst-case time complexity comparable to ordinary persistent homology. We provide proofs demonstrating the correctness and computational complexity of this approach in addition to a performance-optimized implementation for a special case.
Open AccessA U-match Algorithm for Persistent Relative Homology
A central problem in data-driven scientific inquiry is how to interpret structure in noisy, high-dimensional data. Topological data analysis (TDA) provides a solution via persistent homology, which encodes features of interest as topological holes within a filtration of data. The present work extends this framework to a related invariant which uncovers topological structure of a space relative to a subspace: persistent relative homology (PRH). We show that this invariant can be computed in a simple, highly transparent and general manner, using a two-step matrix reduction technique with worst-case time complexity comparable to ordinary persistent homology. We provide proofs demonstrating the correctness and computational complexity of this approach in addition to a performance-optimized implementation for a special case.
- 30 September 2025
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 26 (4) , 1-53
Interval Decomposition of Persistence Modules over a Principal Ideal Domain
- 30 September 2025
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 26 (4) , 1-53
Interval Decomposition of Persistence Modules over a Principal Ideal Domain
- Open Access
Malicious Cyber Activity Detection Using Zigzag Persistence
In this study we synthesize zigzag persistence from topological data analysis with autoencoder-based approaches to detect malicious cyber activity and derive analytic insights. Cybersecurity aims to safeguard computers, networks, and servers from various forms of malicious attacks, including network damage, data theft, and activity monitoring. Here we focus on the detection of malicious activity using log data. To do this we consider the dynamics of the data by exploring the changing topology of a hypergraph representation gaining insights into the underlying activity. Hypergraphs provide a natural representation of cyber log data by capturing complex interactions between processes. To study the changing topology we use zigzag persistence which captures how topological features persist at multiple dimensions over time. We observe that the resulting barcodes represent malicious activity differently than benign activity. To automate this detection we implement an autoencoder trained on a vectorization of the resulting zigzag persistence barcodes. Our experimental results demonstrate the effectiveness of the autoencoder in detecting malicious activity in comparison to standard summary statistics. Overall, this study highlights the potential of zigzag persistence and its combination with temporal hypergraphs for analyzing cybersecurity log data and detecting malicious behavior.
Open AccessMalicious Cyber Activity Detection Using Zigzag Persistence
In this study we synthesize zigzag persistence from topological data analysis with autoencoder-based approaches to detect malicious cyber activity and derive analytic insights. Cybersecurity aims to safeguard computers, networks, and servers from various forms of malicious attacks, including network damage, data theft, and activity monitoring. Here we focus on the detection of malicious activity using log data. To do this we consider the dynamics of the data by exploring the changing topology of a hypergraph representation gaining insights into the underlying activity. Hypergraphs provide a natural representation of cyber log data by capturing complex interactions between processes. To study the changing topology we use zigzag persistence which captures how topological features persist at multiple dimensions over time. We observe that the resulting barcodes represent malicious activity differently than benign activity. To automate this detection we implement an autoencoder trained on a vectorization of the resulting zigzag persistence barcodes. Our experimental results demonstrate the effectiveness of the autoencoder in detecting malicious activity in comparison to standard summary statistics. Overall, this study highlights the potential of zigzag persistence and its combination with temporal hypergraphs for analyzing cybersecurity log data and detecting malicious behavior.