-
Notifications
You must be signed in to change notification settings - Fork 18
Cycle Lifting (Graph to Cell)
Guillermo Bernárdez edited this page Mar 6, 2025
·
1 revision
To lift a graph to a cell complex (CC) we proceed as follows. First, we identify a finite set of cycles (closed loops) within the graph. Second, each identified cycle in the graph is associated to a 2-cell, such that the boundary of the 2-cell is the cycle. The nodes and edges of the cell complex are inherited from the graph.
Reference: Topological Deep Learning: Going Beyond Graph Data, Appendix B
- 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