Fetching the paper…
Reading the bibliography…
Topological Signal Processing (TSP) over simplicial complexes is a framework that has been recently proposed, as a generalization of graph signal processing (GSP), to extend GSP to analyzing signals defined over sets of any order (i.e., not only vertices of a graph) and to capture multiway relations of any order among the data.
“Diskrete Räume,”
P. S. Alexandroff, · 1937
Earlier work this paper cites.
Hypergraphs: combinatorics of finite sets
C. Berge, · 1989
Earlier work this paper cites.
“Traffic models for wireless communication networks,”
K. K. Leung, W. A. Massey, and W. Whitt, · 1994
Earlier work this paper cites.
“Computing Betti numbers via combinatorial Laplacians,”
J. Friedman, · 1996
Earlier work this paper cites.
“Atomic decomposition by basis pursuit,”
S. S. Chen, D. L. Donoho, and M. A. Saunders, · 1998
Earlier work this paper cites.
“Constructing projections on sums and intersections,”
R. Piziak, P. L. Odell, and R. Han, · 1999
Earlier work this paper cites.
“Cell complexes through time,”
R. Klette, · 2000
Earlier work this paper cites.
Topology
J. R. Munkres, · 2000
Earlier work this paper cites.
Matrix analysis and applied linear algebra
C. D. Meyer, · 2000
Earlier work this paper cites.
Algebraic graph theory
C. Godsil and G. F. Royle, · 2001
Earlier work this paper cites.
Ordered sets: An Introduction with Connections from Combinatorics to Topology
B. Schröder, · 2003
Earlier work this paper cites.
Algebraic topology
A. Hatcher, · 2005
Earlier work this paper cites.
“Protein function prediction via graph kernels,”
K. M. Borgwardt et al., · 2005
Earlier work this paper cites.
Matrix mathematics: theory, facts, and formulas
D. S. Bernstein, · 2005
Earlier work this paper cites.
“Control using higher order Laplacians in network topologies,”
A. Muhammad and M. Egerstedt, · 2006
Earlier work this paper cites.
“Persistent homology-a survey,”
H. Edelsbrunner and J. Harer, · 2008
Earlier work this paper cites.
“Maps of random walks on complex networks reveal community structure,”
M. Rosvall and C. T. Bergstrom, · 2008
Earlier work this paper cites.
“Topology and data,”
G. Carlsson, · 2009
Earlier work this paper cites.
“Finite impulse response filters for simplicial complexes,”
M. Yang, E. Isufi, M. T. Schaub, and G. Leus, · 2009
Earlier work this paper cites.
“Persistent homology of complex networks,”
D. Horak, S. Maletić, and M. Rajković, · 2009
Earlier work this paper cites.
Discrete calculus: Applied analysis on graphs for computational science
L. J. Grady and J. R. Polimeni, · 2010
Earlier work this paper cites.
“Distributed coverage verification in sensor networks without location information,”
A. Tahbaz-Salehi and A. Jadbabaie, · 2010
Cited alongside, same era.
“SNDlib 1.0–Survivable Network Design Library,”
S. Orlowski, M. Pióro, A. Tomaszewski, and R. Wessäly, · 2010
Cited alongside, same era.
“Statistical ranking and combinatorial Hodge theory,”
X. Jiang, L. H. Lim, Y. Yao, and Y. Ye, · 2011
Cited alongside, same era.
Algebraic topology of finite topological spaces and applications
J. A. Barmak, · 2011
Cited alongside, same era.
Discrete mathematics
J. Gallier, · 2011
Cited alongside, same era.
“The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,”
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, · 2013
“Graph topology inference based on sparsifying transform learning,”
S. Sardellitti, S. Barbarossa, and P. Di Lorenzo, · 2019
Later among the works it cites.
“The topology of higher-order complexes associated with brain hubs in human connectomes,”
M. Andjelković, B. Tadić, and R. Melnik, · 2020
Later among the works it cites.
“Topological signal processing over simplicial complexes,”
S. Barbarossa and S. Sardellitti, · 2020
Later among the works it cites.
“Topological signal processing: Making sense of data building on multiway relations,”
S. Barbarossa and S. Sardellitti, · 2020
Later among the works it cites.
“Random walks on simplicial complexes and the normalized Hodge 1-Laplacian,”
M. T. Schaub, A.R. Benson, P. Horn, G. Lippner, and A. Jadbabaie, · 2020
Later among the works it cites.
“Simplicial neural networks,”
S. Ebli, M. Defferrard, and G. Spreemann, · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Spectra of combinatorial Laplace operators on simplicial complexes,”
D. Horak and J. Jost, · 2013
Cited alongside, same era.
“A simplicial complex-based approach to unmixing tumor progression data,”
T. Roman, A. Nayyeri, B. T. Fasy, and R. Schwartz, · 2015
Cited alongside, same era.
Geometric methods in signal and image analysis
H. Krim and A. B. Hamza, · 2015
Cited alongside, same era.
“Hodge Laplacians on graphs,”
L.-H. Lim, · 2015
Cited alongside, same era.
“Topology-function conservation in protein–protein interaction networks,”
D. Davis et al., · 2015
Cited alongside, same era.
Topological signal processing
M. Robinson, · 2016
Cited alongside, same era.
Later among the works it cites.
“Topological computing of arrangements with (co)chains,”
A. Paoluzzi et al., · 2020
Later among the works it cites.
“Distributed signal processing and optimization based on in-network subspace projections,”
P. Di Lorenzo, S. Barbarossa, and S. Sardellitti, · 2020
Later among the works it cites.
“Topological signal processing over cell complexes,”
S. Sardellitti, S. Barbarossa, and L. Testa, · 2021
Later among the works it cites.
“Signal processing on higher-order networks: Livin’ on the edge… and beyond,”
M. T. Schaub, Y. Zhu, J.-B. Seby, T. M. Roddenberry, and S. Segarra, · 2021
Later among the works it cites.
“Simplicial and topological descriptions of human brain dynamics,”
J. Billings, M. Saggar, J. Hlinka, S. Keilholz, and G. Petri, · 2021
Later among the works it cites.
“Weisfeiler and Lehman go topological: Message passing simplicial networks,”
C. Bodnar and al., · 2021
Later among the works it cites.
“Principled simplicial neural networks for trajectory prediction,”
T. M. Roddenberry, N. Glaze, and S. Segarra, · 2021
Later among the works it cites.
“Geometric deep learning: Grids, groups, graphs, geodesics, and gauges,”
M. M. Bronstein, J. Bruna, T. Cohen, and P. Veličković, · 2021
Later among the works it cites.
“Weisfeiler and Lehman go cellular: CW networks,”
C. Bodnar et al., · 2021
Later among the works it cites.
“Topological deep learning: Going beyond graph data,”
M. Hajij et al., · 2022
Closest in time.
“Simplicial attention neural networks,”
L. Giusti, C. Battiloro, P. Di Lorenzo, S. Sardellitti, and S. Barbarossa, · 2022
Closest in time.
“Signal processing on cell complexes,”
T. M. Roddenberry, M. T. Schaub, and M. Hajij, · 2022
Closest in time.
“Higher-order attention networks,”
M. Hajij et al., · 2022
Closest in time.
“Modeling bounded and unbounded space with polyhedra: Topology and operators for manifold cell complexes,”
W. Huhnt, M. Sternal, and P. J. Pahl, · 2022
Closest in time.
“Cell attention networks,”
L. Giusti, C. Battiloro, L. Testa, P. Di Lorenzo, S. Sardellitti, and S. Barbarossa, · 2023
Closest in time.