DeepAI AI Chat
Log In Sign Up

Towards Stratified Space Learning: Linearly Embedded Graphs

by   Yossi Bokor Bleile, et al.

In this paper, we consider the simplest class of stratified spaces – linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled from it. We use tools and inspiration from computational geometry, algebraic topology, and topological data analysis and prove the correctness of the identified abstract structure under assumptions on the embedding. The algorithm is implemented in the Julia package , which we used for the numerical simulations in this paper.


page 1

page 2

page 3

page 4


Towards Stratified Space Learning: 2-complexes

In this paper, we consider a simple class of stratified spaces – 2-compl...

Stratified Space Learning: Reconstructing Embedded Graphs

Many data-rich industries are interested in the efficient discovery and ...

PERCEPT: a new online change-point detection method using topological data analysis

Topological data analysis (TDA) provides a set of data analysis tools fo...

PointLIE: Locally Invertible Embedding for Point Cloud Sampling and Recovery

Point Cloud Sampling and Recovery (PCSR) is critical for massive real-ti...

Computing Klein-Gordon Spectra

We study the computational complexity of the eigenvalue problem for the ...

Degenerating families of dendrograms

Dendrograms used in data analysis are ultrametric spaces, hence objects ...

Topological Data Analysis with ε-net Induced Lazy Witness Complex

Topological data analysis computes and analyses topological features of ...