Metric graph reconstruction from noisy data
From MaRDI portal
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)- Homotopical decompositions of simplicial and Vietoris Rips complexes
- Empirical geodesic graphs and CAT(k) metrics for data analysis
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Statistical analysis of metric graph reconstruction
- Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
- Nonparametric ridge estimation
- On the Reconstruction of Geodesic Subspaces of ℝN
- Graph approximations to the Laplacian spectra
- Vietoris-Rips and Čech complexes of metric gluings
- Graph reconstruction by discrete Morse theory
- Local homology transfer and stratification learning
- A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
- Vietoris-Rips complexes of metric spaces near a metric graph
- Minimum monotone tree decomposition of density functions defined on graphs
- Asymptotic theory for density ridges
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)
