arXiv · 2003.06285
Branch points and stability
Abstract
The hierarchy poset and branch point poset for a data set both admit a calculus of least upper bounds. A method involving upper bounds is used to show that the map of branch points associated to the inclusion of data sets is a controlled homotopy equivalence, where the control is expressed by an upper bound relation that is constrained by Hausdorff distance.
Explore related subjects
Keep this discovery
J. F. Jardine. 2020-03-12. Branch points and stability. https://arxiv.org/abs/2003.06285
Cite the original work for its findings. Save a collection to share your selection of sources.