Month: May 2019

  • Geometry of Big Data – Tuesday session

    Session 1 – Graph-based persistence The talk On the density of expected persistence diagrams and its kernel based estimation is given by Frederic Chazal. A draft is available on arxiv. Grow circles around point data to generate a graph whenever other points meet the circle and produce a persistent homology of filtered simplicial complexes (e.g…