Expander Hypergraph Lifting (Graph to Hypergraph) - geometric-intelligence/TopoBench GitHub Wiki

This lifting generates an expander (hyper-)graph, more precisely a random Ramanujan graph. It is inspired by recent works on expander graph propagation and expander graph transformers. Expander graphs have favourable, mathematical guarantees w.r.t. node connectivity. E.g., they enable message propagation from any node to any other node in few iterations.

Tags and categories:

existing lifting from the literature (however GNN literature) | connectivity-based lifting | non-deterministic lifting

Submission by team MIA-UT: Patryk Rygiel (@PatRyg99), Julian Suk (@sukjulian)

From https://github.com/pyt-team/challenge-icml-2024/pull/23