Audun Myers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Audun Myers has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Firas A. Khasawneh
Michigan State University
13 shared publications - Elizabeth Munch
Michigan State University, East Lansing, MI, USA
6 shared publications Bill Kay
Pacific Northwest National Laboratory, Richland, USA
4 shared publications- Max M. Chumley
Mechanical Engineering and Computational Mathematics Science and Engineering Michigan State University East Lansing MI
4 shared publications - Brittany Terese Fasy
Montana State University
2 shared publications Cameron Mackenzie
Pacific Northwest National Laboratory, Richland, USA
2 shared publications
Latest Publications
- Open Access
- 2 November 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1) , 36309
Entropic analysis of time series through kernel density estimation
- 2 November 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1) , 36309
Open AccessEntropic analysis of time series through kernel density estimation
- Open Access
- 12 January 2026
- Published by Springer Nature in Research Square
Entropic Analysis of Time Series through Kernel Density Estimation
This work presents a novel framework for time series analysis using entropic measures based on the kernel density estimate (KDE) of a time series' Takens' embedding in two dimensions. Using this framework we introduce two distinct analytical tools: (1) a multi-scale KDE entropy metric, denoted as $\Delta\text{KE}$, which quantifies the evolution of time series complexity across different delay time scales by measuring changes in entropy, and (2) a sliding baseline method that employs the Kullback-Leibler (KL) divergence to detect changes in time series structure through changes in KDEs. The $\Delta{\rm KE}$ metric offers insights into the information content and ''unfolding'' properties of the time series' Takens' embedding well-suited to the analysis of dynamical systems, while the KL-divergence-based approach provides a noise and outlier robust measure for identifying time series change points well-suited to the detection of injected radio frequency (RF) signals in noisy backgrounds. We demonstrate the effectiveness and versatility of these tools through a set of experiments across several science and technology domains. In the case of RF communications, we achieve accurate detection of injected signals under varying noise and interference conditions comparable with tools of the art and without the need for training. Secondly, we apply our methodology to electrocardiography (ECG) data, successfully identifying instances of ventricular fibrillation with high accuracy. Finally, we demonstrate the potential of our tools for identifying anomalous intermittent chaotic regimes within a signal in dynamical systems.- 12 January 2026
- Published by Springer Nature in Research Square
Open AccessEntropic Analysis of Time Series through Kernel Density Estimation
This work presents a novel framework for time series analysis using entropic measures based on the kernel density estimate (KDE) of a time series' Takens' embedding in two dimensions. Using this framework we introduce two distinct analytical tools: (1) a multi-scale KDE entropy metric, denoted as $\Delta\text{KE}$, which quantifies the evolution of time series complexity across different delay time scales by measuring changes in entropy, and (2) a sliding baseline method that employs the Kullback-Leibler (KL) divergence to detect changes in time series structure through changes in KDEs. The $\Delta{\rm KE}$ metric offers insights into the information content and ''unfolding'' properties of the time series' Takens' embedding well-suited to the analysis of dynamical systems, while the KL-divergence-based approach provides a noise and outlier robust measure for identifying time series change points well-suited to the detection of injected radio frequency (RF) signals in noisy backgrounds. We demonstrate the effectiveness and versatility of these tools through a set of experiments across several science and technology domains. In the case of RF communications, we achieve accurate detection of injected signals under varying noise and interference conditions comparable with tools of the art and without the need for training. Secondly, we apply our methodology to electrocardiography (ECG) data, successfully identifying instances of ventricular fibrillation with high accuracy. Finally, we demonstrate the potential of our tools for identifying anomalous intermittent chaotic regimes within a signal in dynamical systems. - 6 May 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (3)
Understanding high-order network structure using permissible walks on attributed hypergraphs
Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance—how to leverage information carried in hypergraph attributions when doing walk-based techniques. In this work, we focus on a new generalization of a walk in a network that recovers previous approaches and allows for a description of permissible walks in hypergraphs. Permissible walk graphs are constructed by intersecting the attributed s-line graph of a hypergraph with a relation respecting graph. The attribution of the hypergraph’s line graph commonly carries over information from categorical and temporal attributions of the original hypergraph. To demonstrate this approach on a temporally attributed example, we apply our framework to a Reddit data set composed of hyperedges as threads and authors as nodes where post times are tracked.
- 6 May 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (3)
Understanding high-order network structure using permissible walks on attributed hypergraphs
Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance—how to leverage information carried in hypergraph attributions when doing walk-based techniques. In this work, we focus on a new generalization of a walk in a network that recovers previous approaches and allows for a description of permissible walks in hypergraphs. Permissible walk graphs are constructed by intersecting the attributed s-line graph of a hypergraph with a relation respecting graph. The attribution of the hypergraph’s line graph commonly carries over information from categorical and temporal attributions of the original hypergraph. To demonstrate this approach on a temporally attributed example, we apply our framework to a Reddit data set composed of hyperedges as threads and authors as nodes where post times are tracked.
- Open Access
- 14 March 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (107)
Teaspoon: A Python Package for Topological Signal Processing
- 14 March 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (107)
Open AccessTeaspoon: A Python Package for Topological Signal Processing
- 10 June 2024
- Published by Springer Nature in La Matematica
- Vol. 3 (3) , 1103-1136
Delay Parameter Selection in Permutation Entropy Using Topological Data Analysis
- 10 June 2024
- Published by Springer Nature in La Matematica
- Vol. 3 (3) , 1103-1136
Delay Parameter Selection in Permutation Entropy Using Topological Data Analysis
- 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.
- Open Access
Temporal Network Analysis Using Zigzag Persistence
This work presents a framework for studying temporal networks using zigzag persistence, a tool from the field of Topological Data Analysis (TDA). The resulting approach is general and applicable to a wide variety of time-varying graphs. For example, these graphs may correspond to a system modeled as a network with edges whose weights are functions of time, or they may represent a time series of a complex dynamical system. We use simplicial complexes to represent snapshots of the temporal networks that can then be analyzed using zigzag persistence. We show two applications of our method to dynamic networks: an analysis of commuting trends on multiple temporal scales, e.g., daily and weekly, in the Great Britain transportation network, and the detection of periodic/chaotic transitions due to intermittency in dynamical systems represented by temporal ordinal partition networks. Our findings show that the resulting zero- and one-dimensional zigzag persistence diagrams can detect changes in the networks' shapes that are missed by traditional connectivity and centrality graph statistics.
Open AccessTemporal Network Analysis Using Zigzag Persistence
This work presents a framework for studying temporal networks using zigzag persistence, a tool from the field of Topological Data Analysis (TDA). The resulting approach is general and applicable to a wide variety of time-varying graphs. For example, these graphs may correspond to a system modeled as a network with edges whose weights are functions of time, or they may represent a time series of a complex dynamical system. We use simplicial complexes to represent snapshots of the temporal networks that can then be analyzed using zigzag persistence. We show two applications of our method to dynamic networks: an analysis of commuting trends on multiple temporal scales, e.g., daily and weekly, in the Great Britain transportation network, and the detection of periodic/chaotic transitions due to intermittency in dynamical systems represented by temporal ordinal partition networks. Our findings show that the resulting zero- and one-dimensional zigzag persistence diagrams can detect changes in the networks' shapes that are missed by traditional connectivity and centrality graph statistics.
- Open Access
Persistent Homology of Coarse Grained State Space Networks
This work is dedicated to the topological analysis of complex transitional networks for dynamic state detection. Transitional networks are formed from time series data and they leverage graph theory tools to reveal information about the underlying dynamic system. However, traditional tools can fail to summarize the complex topology present in such graphs. In this work, we leverage persistent homology from topological data analysis to study the structure of these networks. We contrast dynamic state detection from time series using a coarse-grained state-space network (CGSSN) and topological data analysis (TDA) to two state of the art approaches: ordinal partition networks (OPNs) combined with TDA and the standard application of persistent homology to the time-delay embedding of the signal. We show that the CGSSN captures rich information about the dynamic state of the underlying dynamical system as evidenced by a significant improvement in dynamic state detection and noise robustness in comparison to OPNs. We also show that because the computational time of CGSSN is not linearly dependent on the signal's length, it is more computationally efficient than applying TDA to the time-delay embedding of the time series.
Open AccessPersistent Homology of Coarse Grained State Space Networks
This work is dedicated to the topological analysis of complex transitional networks for dynamic state detection. Transitional networks are formed from time series data and they leverage graph theory tools to reveal information about the underlying dynamic system. However, traditional tools can fail to summarize the complex topology present in such graphs. In this work, we leverage persistent homology from topological data analysis to study the structure of these networks. We contrast dynamic state detection from time series using a coarse-grained state-space network (CGSSN) and topological data analysis (TDA) to two state of the art approaches: ordinal partition networks (OPNs) combined with TDA and the standard application of persistent homology to the time-delay embedding of the signal. We show that the CGSSN captures rich information about the dynamic state of the underlying dynamical system as evidenced by a significant improvement in dynamic state detection and noise robustness in comparison to OPNs. We also show that because the computational time of CGSSN is not linearly dependent on the signal's length, it is more computationally efficient than applying TDA to the time-delay embedding of the time series.
- 2 March 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 107 (3) , 034303
Persistent homology of coarse-grained state-space networks
This work is dedicated to the topological analysis of complex transitional networks for dynamic state detection. Transitional networks are formed from time series data and they leverage graph theory tools to reveal information about the underlying dynamic system. However, traditional tools can fail to summarize the complex topology present in such graphs. In this work, we leverage persistent homology from topological data analysis to study the structure of these networks. We contrast dynamic state detection from time series using a coarse-grained state-space network (CGSSN) and topological data analysis (TDA) to two state of the art approaches: ordinal partition networks (OPNs) combined with TDA and the standard application of persistent homology to the time-delay embedding of the signal. We show that the CGSSN captures rich information about the dynamic state of the underlying dynamical system as evidenced by a significant improvement in dynamic state detection and noise robustness in comparison to OPNs. We also show that because the computational time of CGSSN is not linearly dependent on the signal's length, it is more computationally efficient than applying TDA to the time-delay embedding of the time series.
- 2 March 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 107 (3) , 034303
Persistent homology of coarse-grained state-space networks
This work is dedicated to the topological analysis of complex transitional networks for dynamic state detection. Transitional networks are formed from time series data and they leverage graph theory tools to reveal information about the underlying dynamic system. However, traditional tools can fail to summarize the complex topology present in such graphs. In this work, we leverage persistent homology from topological data analysis to study the structure of these networks. We contrast dynamic state detection from time series using a coarse-grained state-space network (CGSSN) and topological data analysis (TDA) to two state of the art approaches: ordinal partition networks (OPNs) combined with TDA and the standard application of persistent homology to the time-delay embedding of the signal. We show that the CGSSN captures rich information about the dynamic state of the underlying dynamical system as evidenced by a significant improvement in dynamic state detection and noise robustness in comparison to OPNs. We also show that because the computational time of CGSSN is not linearly dependent on the signal's length, it is more computationally efficient than applying TDA to the time-delay embedding of the time series.