Expander hypergraph lifting (graph to hypergraph) #23
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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
The code would be considerably cleaner if we had access to
networkx >= 3.3
. As a workaround, we copy & pasted the required functions here. However, this can be removed and cleaned up oncenetworkx
is upgraded.Submission by team MIA-UT: Patryk Rygiel (@PatRyg99), Julian Suk (@sukjulian)