-
Notifications
You must be signed in to change notification settings - Fork 18
Graph Induced Lifting (Graph to Simplicial)
Guillermo Bernárdez edited this page Mar 4, 2025
·
1 revision
Construct a simplicial complex where each simplex corresponds to a connected subgraph of the original graph. The vertices of the simplex are the vertices of the subgraph, and the higher-dimensional faces represent larger connected subgraphs. Compared to clique lifting, the graph-induced lifting includes simplices for any connected subgraph, resulting in a potentially richer and more varied complex.
From https://github.com/pyt-team/challenge-icml-2024/pull/8
- Defining GCCNs
- Defining backbone models
- Reproducing experiments
-
Graph to Simplicial Complex
-
Graph to Cell Complex
-
Graph to Hypergraph
-
Graph to Combinatorial
-
Pointcloud to Graph
-
Pointcloud to Simplicial
-
Pointcloud to Hypergraph
-
Hypergraph to Simplicial
-
Hypergraph to Combinatorial