Distributed Mapper

12/11/2017
by   Mustafa Hajij, et al.
0

The construction of Mapper has emerged in the last decade as a powerful and effective topological data analysis tool that approximates and generalizes other topological summaries, such as the Reeb graph, the contour tree, split, and joint trees. In this paper we study the parallel analysis of the construction of Mapper. We give a provably correct algorithm to distribute Mapper on a set of processors and discuss the performance results that compare our approach to a reference sequential Mapper implementation. We report the performance experiments that demonstrate the efficiency of our method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2019

Task-based Augmented Contour Trees with Fibonacci Heaps

This paper presents a new algorithm for the fast, shared memory, multi-c...
research
10/24/2017

The Shape of an Image: A Study of Mapper on Images

We study the topological construction called Mapper in the context of si...
research
05/05/2021

Stitch Fix for Mapper and Topological Gains

The mapper construction is a powerful tool from topological data analysi...
research
01/25/2023

Fast Merge Tree Computation via SYCL

A merge tree is a topological descriptor of a real-valued function. Merg...
research
09/08/2019

Probabilistic Convergence and Stability of Random Mapper Graphs

We study the probabilistic convergence between the mapper graph and the ...
research
04/23/2023

TopoSZ: Preserving Topology in Error-Bounded Lossy Compression

Existing error-bounded lossy compression techniques control the pointwis...
research
08/15/2023

Portfolio Selection via Topological Data Analysis

Portfolio management is an essential part of investment decision-making....

Please sign up or login with your details

Forgot password? Click here to reset