Fréchet Means for Distributions of Persistence Diagrams

Katharine Turner*, Yuriy Mileyko, Sayan Mukherjee, John Harer

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

148 Citations (Scopus)

Abstract

Given a distribution ρ on persistence diagrams and observations (Formula presented.) we introduce an algorithm in this paper that estimates a Fréchet mean from the set of diagrams X1,...,Xn. If the underlying measure ρ is a combination of Dirac masses (Formula presented.) then we prove the algorithm converges to a local minimum and a law of large numbers result for a Fréchet mean computed by the algorithm given observations drawn iid from ρ. We illustrate the convergence of an empirical mean computed by the algorithm to a population mean by simulations from Gaussian random fields.

Original languageEnglish
Pages (from-to)44-70
Number of pages27
JournalDiscrete and Computational Geometry
Volume52
Issue number1
DOIs
Publication statusPublished - Jul 2014
Externally publishedYes

Fingerprint

Dive into the research topics of 'Fréchet Means for Distributions of Persistence Diagrams'. Together they form a unique fingerprint.

Cite this