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

For each node in the graph, take the set of its neighbors, up to k distance, and the node itself. These sets are then treated as simplices. The dimension of each simplex depends on the degree of the nodes. For example, a node with d neighbors forms a d-simplex.

Reference: Neighborhood Complexes