Metric graph reconstruction from noisy data
From MaRDI portal
Publication:5404405
Recommendations
- Statistical analysis of metric graph reconstruction
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
- Graph reconstruction by discrete Morse theory
- A Quest to Unravel the Metric Structure Behind Perturbed Networks
Cited in
(15)- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Graph reconstruction by discrete Morse theory
- Homotopical decompositions of simplicial and Vietoris Rips complexes
- Asymptotic theory for density ridges
- Graph approximations to the Laplacian spectra
- Local homology transfer and stratification learning
- Vietoris-Rips and Čech complexes of metric gluings
- Nonparametric ridge estimation
- Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
- A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
- Minimum monotone tree decomposition of density functions defined on graphs
- Empirical geodesic graphs and CAT\((k)\) metrics for data analysis
- Vietoris-Rips complexes of metric spaces near a metric graph
- On the Reconstruction of Geodesic Subspaces of ℝN
- Statistical analysis of metric graph reconstruction
This page was built for publication: Metric graph reconstruction from noisy data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404405)
