Towards Stratified Space Learning: Linearly Embedded Graphs

01/12/2021
by   Yossi Bokor Bleile, et al.
0

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 http://github.com/yossibokor/Skyler.jl , which we used for the numerical simulations in this paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2023

Towards Stratified Space Learning: 2-complexes

In this paper, we consider a simple class of stratified spaces – 2-compl...
research
09/27/2019

Stratified Space Learning: Reconstructing Embedded Graphs

Many data-rich industries are interested in the efficient discovery and ...
research
03/08/2022

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

Topological data analysis (TDA) provides a set of data analysis tools fo...
research
05/20/2022

A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud

This thesis consists of two topics related to computational geometry and...
research
04/30/2021

PointLIE: Locally Invertible Embedding for Point Cloud Sampling and Recovery

Point Cloud Sampling and Recovery (PCSR) is critical for massive real-ti...
research
07/27/2023

Bounding the Interleaving Distance for Geometric Graphs with a Loss Function

A geometric graph is an abstract graph along with an embedding of the gr...
research
07/24/2007

Degenerating families of dendrograms

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

Please sign up or login with your details

Forgot password? Click here to reset