TL;DR
BScNets introduces a novel neural network architecture based on simplicial complexes that captures higher-order interactions in graphs, significantly improving link prediction and disease spread modeling.
Contribution
It is the first SNN model utilizing block Hodge-Laplacian for higher-order graph structures, extending GCN frameworks with theoretical foundations and practical applications.
Findings
Outperforms state-of-the-art models in link prediction tasks
Effective in modeling complex multi-node interactions
Low computational cost compared to existing methods
Abstract
Simplicial neural networks (SNN) have recently emerged as the newest direction in graph learning which expands the idea of convolutional architectures from node space to simplicial complexes on graphs. Instead of pre-dominantly assessing pairwise relations among nodes as in the current practice, simplicial complexes allow us to describe higher-order interactions and multi-node graph structures. By building upon connection between the convolution operation and the new block Hodge-Laplacian, we propose the first SNN for link prediction. Our new Block Simplicial Complex Neural Networks (BScNets) model generalizes the existing graph convolutional network (GCN) frameworks by systematically incorporating salient interactions among multiple higher-order graph structures of different dimensions. We discuss theoretical foundations behind BScNets and illustrate its utility for link prediction on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
MethodsConvolution
