Fetching the paper…
Reading the bibliography…
The processing of signals supported on non-Euclidean domains has attracted large interest recently.
L. J. Leblanc, “An algorithm for the discrete network design problem,” Transportation Science
1975
Earlier work this paper cites.
G. Singh, F. Mémoli, G. E. Carlsson, et al
2007
Earlier work this paper cites.
H. Edelsbrunner, J. Harer, et al
2008
Earlier work this paper cites.
G. Carlsson, “Topology and data,” Bulletin of the American Mathematical Society
2009
Earlier work this paper cites.
American Mathematical Society, 2010
H. Edelsbrunner and J. Harer, Computational topology: an introduction · 2010
Earlier work this paper cites.
Springer, 2010
L. J. Grady and J. R. Polimeni, Discrete Calculus · 2010
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “ImageNet classification with deep convolutional neural networks,” in Advances in Neural Information Processing Systems
2012
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,” Signal Processing Magazine
2013
Earlier work this paper cites.
D. Bommes, B. Lévy, N. Pietroni, E. Puppo, C. Silva, M. Tarini, and D. Zorin, “Quad-mesh generation and processing: A survey,” in Computer Graphics Forum
2013
Earlier work this paper cites.
Springer, 2014
M. Robinson, Topological Signal Processing · 2014
Earlier work this paper cites.
S. Barbarossa and M. Tsitsvero, “An introduction to hypergraph signal processing,” in International Conference on Acoustics, Speech, and Signal Processing
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” International Conference on Learning Representations
2017
Earlier work this paper cites.
M. T. Schaub and S. Segarra, “Flow smoothing and denoising: Graph signal processing in the edge-space,” in Global Conference on Signal and Information Processing
2018
Cited alongside, same era.
D. Arya and M. Worring, “Exploiting relational information in social networks using geometric deep learning on hypergraphs,” in ACM International Conference on Multimedia Retrieval
2018
Cited alongside, same era.
J. Jiang, Y. Wei, Y. Feng, J. Cao, and Y. Gao, “Dynamic hypergraph neural networks.,” in International Joint Conference on Artificial Intelligence
2019
Cited alongside, same era.
J. Hansen and R. Ghrist, “Toward a spectral theory of cellular sheaves,” Journal of Applied and Computational Topology
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 SIGKDD Conference on Knowledge Discovery and Data Mining
F. Battiston, G. Cencetti, I. Iacopini, V. Latora, M. Lucas, A. Patania, J.-G. Young, and G. Petri, “Networks beyond pairwise interactions: Structure and dynamics,” Physics Reports
2020
Later among the works it cites.
Z. Jia, S. Lin, M. Gao, M. Zaharia, and A. Aiken, “Improving the accuracy, scalability, and performance of graph neural networks with ROC,” Proceedings of Machine Learning and Systems
2020
Later among the works it cites.
L.-H. Lim, “Hodge Laplacians on Graphs,” SIAM Review
2020
Later among the works it cites.
M. Hajij, K. Istvan, and G. Zamzmi, “Cell complex neural networks,” NeurIPS 2020 Workshop on TDA and Beyond
2020
Later among the works it cites.
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
T. M. Roddenberry and S. Segarra, “HodgeNet: Graph neural networks for edge data,” in Asilomar Conference on Signals, Systems, and Computers
2019
Cited alongside, same era.
S. Barbarossa and S. Sardellitti, “Topological signal processing: Making sense of data building on multiway relations,” Signal Processing Magazine
2020
Cited alongside, same era.
S. Barbarossa and S. Sardellitti, “Topological signal processing over simplicial complexes,” Transactions on Signal Processing
2020
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
2020
Cited alongside, same era.
S. Ebli, M. Defferrard, and G. Spreemann, “Simplicial neural networks,” NeurIPS Workshop on TDA and Beyond
2020
Cited alongside, same era.
E. Bunch, Q. You, G. Fung, and V. Singh, “Simplicial 2-complex convolutional neural nets,” NeurIPS Workshop on TDA and Beyond
2020
Cited alongside, same era.
Closest in time.
M. Yang, E. Isufi, M. T. Schaub, and G. Leus, “Finite impulse response filters for simplicial complexes,” European Signal Processing Conference
2021
Closest in time.
M. T. Schaub, Y. Zhu, J.-B. Seby, T. M. Roddenberry, and S. Segarra, “Signal processing on higher-order networks: Livin’on the edge… and beyond,” Signal Processing
2021
Closest in time.
T. M. Roddenberry, N. Glaze, and S. Segarra, “Principled simplicial neural networks for trajectory prediction,” in International Conference on Machine Learning
2021
Closest in time.
C. Bodnar, F. Frasca, Y. Wang, N. Otter, G. F. Montufar, P. Lio, and M. Bronstein, “Weisfeiler and lehman go topological: Message passing simplicial networks,” in International Conference on Machine Learning
2021
Closest in time.
S. Sardellitti, S. Barbarossa, and L. Testa, “Topological signal processing over cell complexes,” in Asilomar Conference on Signals, Systems, and Computers
2021
Closest in time.
M. Hajij, T. Papamarkou, V. Maroulas, G. Zamzmi, and X. Cai, “Simplicial complex representation learning,” Machine Learning on Graphs Workshop at WSDM’22
2022
Closest in time.