Gromov-Wasserstein Bound between Reeb and Mapper Graphs
We treat Reeb and Mapper graphs as metric measure spaces and give an upper bound on the Gromov-Wasserstein distance between the two.
Download here
We treat Reeb and Mapper graphs as metric measure spaces and give an upper bound on the Gromov-Wasserstein distance between the two.
Download here
Joint work with Fujitsu Ltd. - Now accepted at ECAI 2024!
We introduce a novel variant of the Mapper algorithm in order to find plausible protein conformational pathways. When applied to a 50S-ribosomal dataset, this proves to be more efficient than existing methods, while successfully recovering well-recognized pathways.
Download here
Now accepted at ICML 2024!
The Mapper algorithm has been known to be a powerful tool in visualization and data analytics, but suffers from dependence on many hand-turning parameters. In this work, we propose a relaxation and generalization of the Mapper so that the parameters can be optimized using gradient descent. Convergence results and applications are also provided.
Download here