May 20th (Wed)

Place 274, Building No.3, Grad. Sch. of Eng. (工学部 3 号館274)
contact Center for Computational Science

Time 13:30-14:30
Pawel Dlotko
Inria, Salcay (France)
Cubical complexes, statistical topology and distributed computations
At the beginning of my talk I will give an informal introduction to
persistent homology. Later I will introduce a cubical complexes and
discuss a bitmap representation of them. I will show how the bitmap
can be used in efficient cutting and gluing of cubical complexes.
Ability of cutting and gluing will lead us to a distributed quad-tree
based implementation of computations of persistent homology. I will
sketch the idea of the algorithm and its implementation.
In the second part of my talk I will discuss my library called
Persistence Landscape Toolbox. I will show how the basic algorithms
used and present the main functionalists of the library that can be
used in analysis of persistence diagrams obtained based on data from
fluid dynamics computations.
This talk do not require any prior knowledge of applied/computational topology.