Feature-Based Rips Complex (Point Cloud to Simplicial Complex)

[theo-long]

Implements a feature-based version of the vietoris-rips complex, which allows one to interpolate linearly between 0.0 = standard rips complex and 1.0 = rips complex based entirely on euclidean distance between feature vectors

[review-notebook-app]

Check out this pull request on 

See visual diffs & provide feedback on Jupyter Notebooks.

---

Powered by ReviewNB

[theo-long]

This is a generalization of the usual Rips-Complex, where the pairwise distances can include a factor based on the Euclidean distance of the feature vectors. This may be useful in cases where the features give additional information about the underlying topology (e.g. two points appear close when embedded in Euclidean space but are far apart on the manifold). It can also be used to create models that have more expressive message-passing dynamics, with message passing being done over both the position-based topology and the feature-based topology.

[levtelyatnikov]

Hello, @theo-long ! 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 (Feature-Based Rips Complex (Point Cloud to Simplicial Complex) #35)

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.

[theo-long]

Hi, Information for my team is below: Name: Theodore Long Method: Feature-Based Rips Complex Lifting Input Domain: Point Cloud Output Domain: Simplicial Complex PR Number: 35 Thanks, Theo

…

On Jul 8, 2024, at 12:46 PM, levtelyatnikov ***@***.***> wrote: Hello, @theo-long <https://github.com/theo-long> ! 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 ***@***.*** ***@***.***> 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 (#35 <#35>) 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. — Reply to this email directly, view it on GitHub <#35 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AP7REWDMWXZUWV4FXE6UUL3ZLK7AFAVCNFSM6AAAAABKO2JHMWVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMZDEMJUGY3TKMRXHE>. You are receiving this because you were mentioned.

[gbg141]

Hi @theo-long ! Could you please re-send the information via your mail account? We will need your email for further communications. Thanks!