In this paper, we consider the simplest class of stratified spaces –linearly embedded graphs . We present an algorithm that learns the abstractstructure of an embedded graph and models the specific embedding from a pointcloud sampled from it . We use tools and inspiration from computationalgeometry, algebraic topology, and topological data analysis and prove thecorrectness of the identified abstract structure under assumptions on the embeddedding .

Author(s) : Yossi Bokor, Katharine Turner, Christopher Williams

Links : PDF - Abstract

Code :
Coursera

Keywords : embedded - linearly - stratified - graphs - -

Leave a Reply

Your email address will not be published. Required fields are marked *