Hodgelets: Localized Spectral Representations of Flows on Simplicial Complexes

Abstract

We develop wavelet representations for edge-flows on simplicial complexes, using ideas rooted in combinatorial Hodge theory and spectral graph wavelets. We first show that the Hodge Laplacian can be used in lieu of the graph Laplacian to construct a family of wavelets for higher-order signals on simplicial complexes. Then, we refine this idea to construct wavelets that respect the Hodge-Helmholtz decomposition. For these Hodgelets, familiar notions of curl-free and divergence-free flows from vector calculus are preserved. We characterize the representational quality of our Hodgelets for edge flows in terms of frame bounds and demonstrate the use of these spectral wavelets for sparse representation of edge flows on real and synthetic data.

References in corpus (11)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Attack vulnerability of complex networks
• Topological Signal Processing over Simplicial Complexes
• Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
• Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond
• Graph-based Semi-Supervised & Active Learning for Edge Flows
• Simplicial Neural Networks
• Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Space
• Finite Impulse Response Filters for Simplicial Complexes
• Simplicial 2-Complex Convolutional Neural Nets
• $\Psi$ec: A Local Spectral Exterior Calculus

Cited by in corpus (3)

• Simplicial Convolutional Filters
• Higher-order Connection Laplacians for Directed Simplicial Complexes
• On Local Distributions in Graph Signal Processing