SearcharxivSearch

arXiv subjects

Neil Pritchard

Publications and source records attributed to Neil Pritchard.

3 recordsLinked to original sources

Coarse embeddability of Wasserstein space and the space of persistence diagrams

We prove an equivalence between open questions about the embeddability of the space of persistence diagrams and the space of probability distributions (i.e.~Wasserstein space). It is known that for many natural metrics, no coarse embedding of either of these two spaces into Hilbert space exists. Some cases remain open, however. In particular, whether coarse embeddings exist with respect to the $p$-Wasserstein distance for $1\leq p\leq 2$ remains an open question for the space of persistence diagrams and for Wasserstein space on the plane. In this paper, we show that embeddability for persistence diagrams \redd{is equivalent to} embeddability for Wasserstein space on $\mathbb{R}^2$. \redd{When $p > 1$, Wasserstein space on $\mathbb{R}^2$ is snowflake universal (an obstruction to embeddability into any Banach space of non-trivial type) if and only if the space of persistence diagrams is snowflake universal.

math.MG

Gaussian Persistence Curves

Topological data analysis (TDA) is a rising field in the intersection of mathematics, statistics, and computer science/data science. The cornerstone of TDA is persistent homology, which produces a summary of topological information called a persistence diagram. To utilize machine and deep learning methods on persistence diagrams, These diagrams are further summarized by transforming them into functions. In this paper we investigate the stability and injectivity of a class of smooth, one-dimensional functional summaries called Gaussian persistence curves.

cs.CG

An exploration of Nathanson's $g$-adic representations of integers

We use Nathanson's $g$-adic representation of integers to relate metric properties of Cayley graphs of the integers with respect to various infinite generating sets $S$ to problems in additive number theory. If $S$ consists of all powers of a fixed integer $g$, we find explicit formulas for the smallest positive integer of a given length. This is related to finding the smallest positive integer expressible as a fixed number of sums and differences of powers of $g$. We also consider $S$ to be the set of all powers of all primes and bound the diameter of Cayley graph by relating it to Goldbach's conjecture.

math.GT