mlsanityData to 14 Oct 2026

Signal processing on simplicial complexes

arXiv 2106.07471 ↗First posted 14 Jun 2021eess.SP cs.DM cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Higher-order networks have so far been considered primarily in the context of studying the structure of complex systems, i.e., the higher-order or multi-way relations connecting the constituent entities. More recently, a number of studies have considered dynamical processes that explicitly account for such higher-order dependencies, e.g., in the context of epidemic spreading processes or opinion formation. In this chapter, we focus on a closely related, but distinct third perspective: how can we use higher-order relationships to process signals and data supported on higher-order network structures. In particular, we survey how ideas from signal processing of data supported on regular domains, such as time series or images, can be extended to graphs and simplicial complexes. We discuss Fourier analysis, signal denoising, signal interpolation, and nonlinear processing through neural networks based on simplicial complexes. Key to our developments is the Hodge Laplacian matrix, a multi-relational operator that leverages the special structure of simplicial complexes and generalizes desirable properties of the Laplacian matrix in graph signal processing.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 25 of its 54 references that are in the map. First posted on arXiv 14 Jun 2021.

Builds on

25 of 54 references.

References · 25

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2018Neural Ordinary Differential Equationscited by 3,779
  3. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  4. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  5. 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
  6. 2018Link Prediction Based on Graph Neural Networkscited by 832
  7. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 413
  8. 2016How to learn a graph from smooth signalscited by 146
  9. 2020Networks beyond pairwise interactions: structure and dynamicscited by 130
  10. 2020Simplicial Neural Networkscited by 110
  11. 2019Topological Signal Processing over Simplicial Complexescited by 96
  12. 2018Convolutional Neural Network Architectures for Signals Supported on Graphscited by 95
13 more
  1. 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 86
  2. 2021Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyondcited by 82
  3. 2021Principled Simplicial Neural Networks for Trajectory Predictioncited by 77
  4. 2021What are higher-order networks?cited by 66
  5. 2019HodgeNet: Graph Neural Networks for Edge Datacited by 39
  6. 2018Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Spacecited by 37
  7. 2020Signal Processing on Directed Graphscited by 28
  8. 2014Signal Recovery on Graphs: Variation Minimizationcited by 26
  9. 2019Graph-based Semi-Supervised & Active Learning for Edge Flowscited by 25
  10. 2016Two's company, three (or more) is a simplex: Algebraic-topological tools for understanding higher-order structure in neural datacited by 22
  11. 2020Simplicial complexes: higher-order spectral dimension and dynamicscited by 9
  12. 2019Network Inference from Consensus Dynamics with Unknown Parameterscited by 6
  13. 2015Reconstruction of Graph Signals through Percolation from Seeding Nodescited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 5; 2025: 3; 2026: 3.

12 papers.