Fetching the paper…
Reading the bibliography…
We develop wavelet representations for edge-flows on simplicial complexes, using ideas rooted in combinatorial Hodge theory and spectral graph wavelets.
“Sur la sphère vide,”
Boris Delaunay et al., · 1934
Earlier work this paper cites.
“Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,”
Yagyensh Chandra Pati, Ramin Rezaiifar, and Perinkulam Sambamurthy Krishnaprasad, · 1993
Earlier work this paper cites.
A Wavelet Tour of Signal Processing
Stéphane Mallat, · 1999
Earlier work this paper cites.
“Exploring complex networks,”
Steven H Strogatz, · 2001
Earlier work this paper cites.
“Attack vulnerability of complex networks,”
Petter Holme, Beom Jun Kim, Chang No Yoon, and Seung Kee Han, · 2002
Earlier work this paper cites.
Discrete Exterior Calculus
Anil Nirmal Hirani, · 2003
Earlier work this paper cites.
Algebraic Topology
Allen Hatcher, · 2005
Earlier work this paper cites.
“Signal recovery from random measurements via orthogonal matching pursuit,”
Joel A Tropp and Anna C Gilbert, · 2007
Earlier work this paper cites.
“Applications of graph theory to landscape genetics,”
Colin J Garroway, Jeff Bowman, Denis Carr, and Paul J Wilson, · 2008
Earlier work this paper cites.
Networks: An Introduction
Mark Newman, · 2010
Earlier work this paper cites.
Social and economic networks
Matthew O Jackson, · 2010
Cited alongside, same era.
“A framework for feature selection in clustering,”
Daniela M. Witten and Robert Tibshirani, · 2010
Cited alongside, same era.
“Wavelets on graphs via spectral graph theory,”
David K Hammond, Pierre Vandergheynst, and Rémi Gribonval, · 2011
Cited alongside, same era.
“The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,”
David I Shuman, Sunil K Narang, Pascal Frossard, Antonio Ortega, and Pierre Vandergheynst, · 2013
Cited alongside, same era.
“sparcl: Perform sparse hierarchical clustering and sparse k-means clustering,”
Daniela M Witten and Robert Tibshirani, · 2013
Cited alongside, same era.
“Spectrum-adapted tight graph wavelet and vertex-frequency frames,”
David I Shuman, Christoph Wiesmeyr, Nicki Holighaus, and Pierre Vandergheynst, · 2015
“Topological signal processing: Making sense of data building on multiway relations,”
Sergio Barbarossa and Stefania Sardellitti, · 2020
Later among the works it cites.
“Simplicial neural networks,”
Stefania Ebli, Michaël Defferrard, and Gard Spreemann, · 2020
Later among the works it cites.
“Simplicial 2-complex convolutional neural nets,”
Eric Bunch, Qian You, Glenn Fung, and Vikas Singh, · 2020
Later among the works it cites.
“Random walks on simplicial complexes and the normalized Hodge 1-Laplacian,”
Michael T. Schaub, Austin R. Benson, Paul Horn, Gabor Lippner, and Ali Jadbabaie, · 2020
Later among the works it cites.
“Hodge Laplacians on graphs,”
Lek-Heng Lim, · 2020
Later among the works it cites.
“Finite impulse response filters for simplicial complexes,”
Maosheng Yang, Elvin Isufi, Michael T Schaub, and Geert Leus, · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Flow smoothing and denoising: Graph signal processing in the edge-space,”
Michael T. Schaub and Santiago Segarra, · 2018
Cited alongside, same era.
“Graph-based semi-supervised & active learning for edge flows,”
Junteng Jia, Santiago Segarra, Michael T. Schaub, and Austin R. Benson, · 2019
Cited alongside, same era.
“HodgeNet: Graph neural networks for edge data,”
T. Mitchell Roddenberry and Santiago Segarra, · 2019
Cited alongside, same era.
“Topological signal processing over simplicial complexes,”
Sergio Barbarossa and Stefania Sardellitti, · 2020
Cited alongside, same era.
“Signal processing on higher-order networks: Livin’ on the edge… and beyond,”
Michael T. Schaub, Yu Zhu, Jean-Baptiste Seby, T. Mitchell Roddenberry, and Santiago Segarra, · 2021
Closest in time.
“Principled simplicial neural networks for trajectory prediction,”
T. Mitchell Roddenberry, Nicholas Glaze, and Santiago Segarra, · 2021
Closest in time.
“Weisfeiler and Lehman go topological: Message passing simplicial networks,”
Cristian Bodnar, Fabrizio Frasca, Yuguang Wang, Nina Otter, Guido F Montufar, Pietro Lió, and Michael Bronstein, · 2021
Closest in time.
“ Ψ \Psi ec: A local spectral exterior calculus,”
Christian Lessig, · 2021
Closest in time.