Eccentricity Lifting (Graph to Complex)

[Jonas-Verhellen]

The EccentricityComplexLifting class provides a method to transform a graph into a simplicial complex based on the eccentricity of its vertices. This lifting captures the topology of the graph by forming simplices that reflect the hierarchical structure of vertex neighborhoods, determined by the eccentricity distance. This provides a measure of the spread of each vertex within the graph.

For each vertex, its neighborhood within the eccentricity distance is determined. Simplices are formed from combinations of vertices within each neighborhood. The node features from the original graph are preserved and added to the corresponding nodes in the simplicial complex. Potentially of interest for networks where the spread or influence of a node is of interest, such as in epidemic modeling or information propagation.

[review-notebook-app]

Check out this pull request on 

See visual diffs & provide feedback on Jupyter Notebooks.

---

Powered by ReviewNB

[gbg141]

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 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 (Eccentricity Lifting (Graph to Complex) #10)

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.