Statistical analysis of metric graph reconstruction

MaRDI QIDQ2934135zbMATH OpenFDO

Authors Fabrizio Lecci, Alessandro Rinaldo, Larry Wasserman

Publication date 8 December 2014

Full work available at URL https://arxiv.org/abs/1305.1212, http://jmlr.csail.mit.edu/papers/v15/lecci14a.html

zbMATH Keywords

filamentmanifold learningmetric graphminimax estimationreconstruction

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Minimax procedures in statistical decision theory (62C20) Nonparametric estimation (62G05) Directional data; spatial statistics (62H11) Pattern recognition, speech recognition (68T10)

Abstract: A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as street maps, neurons, networks of rivers and galaxies. We consider the statistical problem of reconstructing the topology of a metric graph embedded in R^D from a random sample. We derive lower and upper bounds on the minimax risk for the noiseless case and tubular noise case. The upper bound is based on the reconstruction algorithm given in Aanjaneya et al. (2012).

Recommendations

• Metric graph reconstruction from noisy data
• 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
• Imaging geometric graphs using internal measurements

Cited in

(13)

• Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
• Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
• Nonparametric ridge estimation
• On the Reconstruction of Geodesic Subspaces of ℝN
• Graph reconstruction by discrete Morse theory
• Metric graph reconstruction from noisy data
• Vietoris-Rips complexes of metric spaces near a metric graph
• Reconstructing linearly embedded graphs: a first step to stratified space learning
• Can we feel the shape of a graph? Can a graph make us feel the shape of data?
• Minimum monotone tree decomposition of density functions defined on graphs
• Confidence regions for filamentary structures
• Imaging geometric graphs using internal measurements
• Asymptotic theory for density ridges

This page was built for publication: Statistical analysis of metric graph reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934135)