Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Expander hypergraph lifting (graph to hypergraph) #23

Open
wants to merge 4 commits into
base: main
Choose a base branch
from

Conversation

sukjulian
Copy link

@sukjulian sukjulian commented Jun 30, 2024

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 once networkx is upgraded.

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

Copy link

Check out this pull request on  ReviewNB

See visual diffs & provide feedback on Jupyter Notebooks.


Powered by ReviewNB

@sukjulian
Copy link
Author

We have been discussing about expander graph lifting and came to the conclusion that the lifting target might not actually qualify as hypergraph: the incidence matrix's rows always sum to two. The lifting could be considered point cloud to graph, but it would be independent of point positions. It's probably best to discuss at some point what aligns best with the concept behind the repository.

@gbg141
Copy link
Member

gbg141 commented Jul 8, 2024

Hello @sukjulian! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at guillermo_bernardez@ucsb.edu so I can share access to the voting form. In your email, please include:

  • your first and last name (as well as any other team members)
  • the title of the method you implemented
  • the input domain of the method you implemented
  • the output domain of the method you implemented
  • your pull request number (Expander hypergraph lifting (graph to hypergraph) #23)

Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified.

@gbg141 gbg141 added award-category-2 Lifting to Combinatorial, Hypergraph or Graph Domain award-category-4 Connectivity-based Lifting labels Jul 9, 2024
@gbg141 gbg141 added Winner Awarded submission and removed challenge-icml-2024 labels Oct 31, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
award-category-2 Lifting to Combinatorial, Hypergraph or Graph Domain award-category-4 Connectivity-based Lifting Winner Awarded submission
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants