arXiv (All)
open access
Gromov-Wasserstein bound between Reeb and Mapper graphs
Since its introduction as a computable approximation of the Reeb graph, the Mapper graph has become one of the most popular tools from topological data analysis for performing data visualization and inference. However, finding an appropriate metric (that is, a tractable metric with theoretical guara
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Grothendieck Graph Neural Networks Framework: An Algebraic Platform for Crafting Topology-Aware GNNs#177024
- The SILVA ribosomal RNA gene database project: improved data processing and web-based tools#6302
- 3DBrainMiner: An open-source platform for modelling and visualizing the brain as graphs#353990
- Classification and Regression using AddiVortes: (Bayesian) Additive Voronoi Tessellations#273042
- Synthesizing Tabular Microdata with Gaussian Copulas: The rsdv R Package#270328
Record · ID 925785
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive