Mapper Lifting with Connectivity Test (Pointcloud to Graph)

[pzajec]

The algorithm initially constructs the Mapper graph from the given point cloud. Each vertex $v$ in the graph is associated with a set of points $\phi(v)$, and two vertices $(u, v)$ are connected if their point sets intersect. Our connectivity test determines whether there is significant evidence for the connectedness of $\phi(u)$ and $\phi(v)$.

We formulate the connectivity test using a recently observed universal property of persistent diagrams [1], which enables us to detect statistically significant homological cycles. The test employs "Weak Universality" and calculates the number of significant relative cycles in $H_1(\phi(u) \cup \phi(v), \phi(u) \setminus \phi(v) \cup \phi(v) \setminus \phi(u))$ as well as the number of significant cycles in $H_1(\phi(u) \cap \phi(v))$. The emergence of new relative cycles confirms the connectivity between $u$ and $v$.

---

[1] Bobrowski, O., Skraba, P. A universal null-distribution for topological data analysis. Sci Rep 13, 12274 (2023).

---

Code for loading and generating point clouds is adapted from #34.

[review-notebook-app[bot]]

Check out this pull request on 

See visual diffs & provide feedback on Jupyter Notebooks.

---

Powered by ReviewNB

[codecov-commenter]

Codecov Report

Attention: Patch coverage is 84.34783% with 18 lines in your changes missing coverage. Please review.

Please upload report for BASE (main@497947b). Learn more about missing BASE report.

Files	Patch %	Lines
modules/data/utils/utils.py	56.75%	16 Missing :warning:
...nsforms/liftings/pointcloud2graph/cover_lifting.py	96.96%	2 Missing :warning:

Additional details and impacted files

```diff @@ Coverage Diff @@ ## main #67 +/- ## ======================================= Coverage ? 68.15% ======================================= Files ? 19 Lines ? 603 Branches ? 0 ======================================= Hits ? 411 Misses ? 192 Partials ? 0 ```

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[gbg141]

Hello @pzajec! 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 (#67)

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.