Fetching the paper…
Reading the bibliography…
In this paper, we study linear filters to process signals defined on simplicial complexes, i.e., signals defined on nodes, edges, triangles, etc.
L. J. Leblanc, “An algorithm for the discrete network design problem,” Transportation Science , vol. 9, no. 3, pp. 183–199, 1975
1975
Earlier work this paper cites.
X. Jiang, L.-H. Lim, Y. Yao, and Y. Ye, “Statistical ranking and combinatorial hodge theory,” Mathematical Programming , vol. 127, no. 1, pp. 203–244, 2011
2011
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE signal processing magazine , vol. 30, no. 3, pp. 83–98, 2013
2013
Earlier work this paper cites.
A. Sandryhaila and J. M. Moura, “Discrete signal processing on graphs,” IEEE transactions on signal processing , vol. 61, no. 7, pp. 1644–1656, 2013
2013
Earlier work this paper cites.
A. C. Wilkerson, T. J. Moore, A. Swami, and H. Krim, “Simplifying the homology of networks via strong collapses,” in 2013 IEEE International Conference on Acoustics, Speech and Signal Processing . IEEE, 2013, pp. 5258–5262
2013
Earlier work this paper cites.
——, “Discrete signal processing on graphs: Frequency analysis,” IEEE Transactions on Signal Processing , vol. 62, no. 12, pp. 3042–3054, 2014
2014
Earlier work this paper cites.
S. Chen, R. Varma, A. Sandryhaila, and J. Kovačević, “Discrete signal processing on graphs: Sampling theory,” IEEE transactions on signal processing , vol. 63, no. 24, pp. 6510–6523, 2015
2015
Earlier work this paper cites.
W. Huang and A. Ribeiro, “Metrics in the space of high order networks,” IEEE Transactions on Signal Processing , vol. 64, no. 3, pp. 615–629, 2015
2015
Cited alongside, same era.
S. Barbarossa and M. Tsitsvero, “An introduction to hypergraph signal processing,” in 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2016, pp. 6425–6429
2016
Cited alongside, same era.
A. Ortega, P. Frossard, J. Kovačević, J. M. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE , vol. 106, no. 5, pp. 808–828, 2018
2018
Cited alongside, same era.
M. T. Schaub and S. Segarra, “Flow smoothing and denoising: Graph signal processing in the edge-space,” in 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP) . IEEE, 2018, pp. 735–739
2018
Cited alongside, same era.
F. Gama, E. Isufi, G. Leus, and A. Ribeiro, “Graphs, convolutions, and neural networks: From graph filters to graph neural networks,” IEEE Signal Processing Magazine , vol. 37, no. 6, pp. 128–138, 2020
2020
Later among the works it cites.
M. Coutino, G. V. Karanikolas, G. Leus, and G. B. Giannakis, “Self-driven graph volterra models for higher-order link prediction,” in ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2020, pp. 3887–3891
2020
Later among the works it cites.
S. Barbarossa and S. Sardellitti, “Topological signal processing over simplicial complexes,” IEEE Transactions on Signal Processing , vol. 68, pp. 2992–3007, 2020
2020
Later among the works it cites.
L.-H. Lim, “Hodge laplacians on graphs,” Siam Review , vol. 62, no. 3, pp. 685–715, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Zhang, Z. Ding, and S. Cui, “Introducing hypergraph signal processing: Theoretical foundation and practical applications,” IEEE Internet of Things Journal , vol. 7, no. 1, pp. 639–660, 2019
2019
Cited alongside, same era.
J. Jia, M. T. Schaub, S. Segarra, and A. R. Benson, “Graph-based semi-supervised & active learning for edge flows,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 761–771
2019
Cited alongside, same era.
T. M. Roddenberry and S. Segarra, “Hodgenet: Graph neural networks for edge data,” in 2019 53rd Asilomar Conference on Signals, Systems, and Computers . IEEE, 2019, pp. 220–224
2019
Cited alongside, same era.
M. T. Schaub, A. R. Benson, P. Horn, G. Lippner, and A. Jadbabaie, “Random walks on simplicial complexes and the normalized hodge 1-laplacian,” SIAM Review , vol. 62, no. 2, pp. 353–391, 2020
2020
Later among the works it cites.
2021
Closest in time.
G. Leus, M. Yang, M. Coutino, and E. Isufi, “Topological volterra filters,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, (accepted) 2021
2021
Closest in time.