Graph Induced Lifting (Graph to Simplicial) - geometric-intelligence/TopoBench GitHub Wiki

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