Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Random Persistence Diagram Generator (2104.07737v4)

Published 15 Apr 2021 in stat.ML, cs.LG, and math.AT

Abstract: Topological data analysis (TDA) studies the shape patterns of data. Persistent homology is a widely used method in TDA that summarizes homological features of data at multiple scales and stores them in persistence diagrams (PDs). In this paper, we propose a random persistence diagram generator (RPDG) method that generates a sequence of random PDs from the ones produced by the data. RPDG is underpinned by a model based on pairwise interacting point processes, and a reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithm. A first example, which is based on a synthetic dataset, demonstrates the efficacy of RPDG and provides a comparison with another method for sampling PDs. A second example demonstrates the utility of RPDG to solve a materials science problem given a real dataset of small sample size.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Theodore Papamarkou (30 papers)
  2. Farzana Nasrin (8 papers)
  3. Austin Lawson (10 papers)
  4. Na Gong (3 papers)
  5. Orlando Rios (2 papers)
  6. Vasileios Maroulas (29 papers)
Citations (9)

Summary

We haven't generated a summary for this paper yet.