Summary
Network analysis has revolutionized our understanding of complex systems, and graph-based methods have emerged as powerful tools to process signals on non-Euclidean domains via graph signal processing and graph neural networks. The graph Laplacian and related matrices are pivotal to such analyses: i) the Laplacian serves as algebraic descriptor of the relationships between nodes; moreover, it is key for the analysis of network structure, for local operations such as averaging over connected nodes, and for network dynamics like diffusion and consensus; ii) Laplacian eigenvectors are natural basis-functions for data on graphs and endowed with meaningful variability notions for graph signals, akin to Fourier analysis in Euclidean domains. However, graphs are ill-equipped to encode multi-way and higher-order relations that are becoming increasingly important to comprehend complex datasets and systems in many applications, e.g., to understand group-dynamics in social systems, multi-gene interactions in genetic data, or multi-way drug interactions.
The goal of this project is to develop methods that can utilize such higher-order relations, going from mathematical models to efficient algorithms and software. Specifically, we will focus on ideas from algebraic topology and discrete calculus, according to which the graph Laplacian can be seen as part of a hierarchy of Hodge-Laplacians that emerge from treating graphs as instances of more general cell complexes that systematically encode couplings between node-tuples of any size. Our ambition is to i) provide more informative ways to represent and analyze the structure of complex systems, paying special attention to computational efficiency; ii) translate the success of graph-based signal processing to data on general topological spaces defined by cell complexes; and iii) by generalizing from graphs to neural networks on complexes, gain deeper theoretical insights on the principles of graph neural networks as special case.
The goal of this project is to develop methods that can utilize such higher-order relations, going from mathematical models to efficient algorithms and software. Specifically, we will focus on ideas from algebraic topology and discrete calculus, according to which the graph Laplacian can be seen as part of a hierarchy of Hodge-Laplacians that emerge from treating graphs as instances of more general cell complexes that systematically encode couplings between node-tuples of any size. Our ambition is to i) provide more informative ways to represent and analyze the structure of complex systems, paying special attention to computational efficiency; ii) translate the success of graph-based signal processing to data on general topological spaces defined by cell complexes; and iii) by generalizing from graphs to neural networks on complexes, gain deeper theoretical insights on the principles of graph neural networks as special case.
Unfold all
/
Fold all
More information & hyperlinks
| Web resources: | https://cordis.europa.eu/project/id/101039827 |
| Start date: | 01-01-2023 |
| End date: | 31-12-2027 |
| Total budget - Public funding: | 1 500 000,00 Euro - 1 500 000,00 Euro |
Cordis data
Original description
Network analysis has revolutionized our understanding of complex systems, and graph-based methods have emerged as powerful tools to process signals on non-Euclidean domains via graph signal processing and graph neural networks. The graph Laplacian and related matrices are pivotal to such analyses: i) the Laplacian serves as algebraic descriptor of the relationships between nodes; moreover, it is key for the analysis of network structure, for local operations such as averaging over connected nodes, and for network dynamics like diffusion and consensus; ii) Laplacian eigenvectors are natural basis-functions for data on graphs and endowed with meaningful variability notions for graph signals, akin to Fourier analysis in Euclidean domains. However, graphs are ill-equipped to encode multi-way and higher-order relations that are becoming increasingly important to comprehend complex datasets and systems in many applications, e.g., to understand group-dynamics in social systems, multi-gene interactions in genetic data, or multi-way drug interactions.The goal of this project is to develop methods that can utilize such higher-order relations, going from mathematical models to efficient algorithms and software. Specifically, we will focus on ideas from algebraic topology and discrete calculus, according to which the graph Laplacian can be seen as part of a hierarchy of Hodge-Laplacians that emerge from treating graphs as instances of more general cell complexes that systematically encode couplings between node-tuples of any size. Our ambition is to i) provide more informative ways to represent and analyze the structure of complex systems, paying special attention to computational efficiency; ii) translate the success of graph-based signal processing to data on general topological spaces defined by cell complexes; and iii) by generalizing from graphs to neural networks on complexes, gain deeper theoretical insights on the principles of graph neural networks as special case.
Status
SIGNEDCall topic
ERC-2021-STGUpdate Date
09-02-2023
Images
No images available.
Geographical location(s)
Search
