Skip to content

DnD Lifting (Graph to Simplicial Complex) #11

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

Merged
merged 6 commits into from
Feb 20, 2025

Conversation

Jonas-Verhellen
Copy link
Contributor

The DnD lifting introduces a novel, non-deterministic, and somewhat lighthearted approach to transforming graphs into simplicial complexes. Inspired by the game mechanics of Dungeons & Dragons (D&D), this method incorporates elements of randomness and character attributes to determine the formation of simplices. This lifting aims to add an element of whimsy and unpredictability to the graph-to-simplicial complex transformation process, while still providing a serious and fully functional methodology.

Each vertex in the graph is assigned the following attributes: degree centrality, clustering coefficient, closeness centrality, eigenvector centrality, betweenness centrality, and pagerank. Simplices are created based on the neighborhood within a distance determined by a D20 dice roll + the attribute value. The randomness from the dice roll, modified by the node's attributes, ensures a non-deterministic process for each lifting. The dice roll is influenced by different attributes based on the level of the simplex being formed. The different attributes for different levels of simplices are used in the order shown above, based on the role of those attributes in the context of the graph structure.

Copy link

Check out this pull request on  ReviewNB

See visual diffs & provide feedback on Jupyter Notebooks.


Powered by ReviewNB

@Jonas-Verhellen Jonas-Verhellen changed the title Dnd Lifting (Graph to Simplicial Complex) DnD Lifting (Graph to Simplicial Complex) Jun 2, 2024
@gbg141
Copy link
Member

gbg141 commented Jul 8, 2024

Hello @Jonas-Verhellen! 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 [email protected] 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 (DnD Lifting (Graph to Simplicial Complex) #11)

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-1 Lifting to Simplicial or Cell Domain award-category-3 Feature-based Lifting (including those that simultaneously leverage the connectivity) labels Jul 9, 2024
@gbg141 gbg141 added Winner Awarded submission and removed challenge-icml-2024 labels Oct 31, 2024
@gbg141 gbg141 merged commit 7a6e303 into pyt-team:main Feb 20, 2025
5 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
award-category-1 Lifting to Simplicial or Cell Domain award-category-3 Feature-based Lifting (including those that simultaneously leverage the connectivity) Winner Awarded submission
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants