Matched Topological Subspace Detector
Not on the map. Why?
Abstract (arXiv)
Topological spaces, represented by simplicial complexes, capture richer relationships than graphs by modeling interactions not only between nodes but also among higher-order entities, such as edges or triangles. This motivates the representation of information defined in irregular domains as topological signals. By leveraging the spectral dualities of Hodge and Dirac theory, practical topological signals often concentrate in specific spectral subspaces (e.g., gradient or curl). For instance, in a foreign currency exchange network, the exchange flow signals typically satisfy the arbitrage-free condition and hence are curl-free. However, the presence of anomalies can disrupt these conditions, causing the signals to deviate from such subspaces. In this work, we formulate a hypothesis testing framework to detect whether simplicial complex signals lie in specific subspaces in a principled and tractable manner. Concretely, we propose Neyman-Pearson matched topological subspace detectors for signals defined at a single simplicial level (such as edges) or jointly across all levels of a simplicial complex. The (energy-based projection) proposed detectors handle missing values, provide closed-form performance analysis, and effectively capture the unique topological properties of the data. We demonstrate the effectiveness of the proposed topological detectors on various real-world data, including foreign currency exchange networks.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 16 of its 33 references that are in the map. First posted on arXiv 8 Apr 2025.
Builds on
16 of 33 references.
References · 16
- 2019Topological Signal Processing over Simplicial Complexescited by 96
- 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 86
- 2021Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyondcited by 82
- 2021What are higher-order networks?cited by 66
- 2021Simplicial Convolutional Neural Networkscited by 40
- 2018Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Spacecited by 37
- 2015Discrete Signal Processing on Graphs: Sampling Theorycited by 34
- 2023Generalized Simplicial Attention Neural Networkscited by 27
- 2019Graph-based Semi-Supervised & Active Learning for Edge Flowscited by 25
- 2022Simplicial Convolutional Filterscited by 18
- 2022Robust Graph Filter Identification and Graph Denoising from Signal Observationscited by 15
- 2024Topological Signal Processing and Learning: Recent Advances and Future Challengescited by 12
4 more
- 2021The topological Dirac equation of networks and simplicial complexescited by 11
- 2022Convolutional Filtering in Simplicial Complexescited by 8
- 2022Weighted simplicial complexes and their representation power of higher-order network data and topologycited by 8
- 2022Higher-order signal processing with the Dirac operatorcited by 8
Built on by
Citing papers per year: 2026: 3.
3 papers.