Related papers: $\ell^p$-Distances on Multiparameter Persistence M…
Measuring dependence between random variables is a fundamental problem in Statistics, with applications across diverse fields. While classical measures such as Pearson's correlation have been widely used for over a century, they have…
Interleaving distances provide a fundamental tool for comparing persistence modules and have been widely used in topological data analysis. Their definitions are typically based on translation structures (shift operations) on the indexing…
N. Fournier and A. Guillin obtained in their 2015 PTRF paper some bounds of the L^p-mean rate of convergence in Wasserstein distance of empirical distributions for a class of stationary mixing processes. In this paper, we propose to extend…
The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…
In this paper, we investigate discrete regularity estimates for a broad class of temporal numerical schemes for parabolic stochastic evolution equations. We provide a characterization of discrete stochastic maximal $\ell^p$-regularity in…
Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical…
Comparing probability distributions is at the crux of many machine learning algorithms. Maximum Mean Discrepancies (MMD) and Wasserstein distances are two classes of distances between probability distributions that have attracted abundant…
The object of this paper is to study estimates of $\epsilon^{-q}W_p(\mu+\epsilon\nu, \mu)$ for small $\epsilon>0$. Here $W_p$ is the Wasserstein metric on positive measures, $p>1$, $\mu$ is a probability measure and $\nu$ a signed, neutral…
Given a filtration of simplicial complexes, one usually applies persistent homology and summarizes the results in barcodes. Then, in order to extract statistical information from these barcodes, one needs to compute statistical indicators…
We prove that front tracking approximations to entropy solutions of scalar conservation laws with convex fluxes converge at a rate of $\Delta x^2$ in the 1-Wasserstein distance $W_1$. Assuming positive initial data, we also show that the…
The interleaving distance is arguably the most widely used metric in topological data analysis (TDA) due to its applicability to a wide array of inputs of interest, such as (multiparameter) persistence modules, Reeb graphs, merge trees, and…
We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural…
Sliced Wasserstein distances preserve properties of classic Wasserstein distances while being more scalable for computation and estimation in high dimensions. The goal of this work is to quantify this scalability from three key aspects: (i)…
We study transport distances on metric graphs representing gas networks. Starting from the dynamic formulation of the Wasserstein distance, we review extensions to networks, with and without the possibility of storing mass on the vertices.…
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance…
Distances between probability distributions that take into account the geometry of their sample space,like the Wasserstein or the Maximum Mean Discrepancy (MMD) distances have received a lot of attention in machine learning as they can, for…
Hyperuniformity is an emergent property, whereby the structure factor of the density $n$ scales as $S(q) \sim q^\alpha$, with $\alpha>0$. We show that for the conserved directed percolation (CDP) class, to which the Manna model belongs,…
Despite the obvious similarities between the metrics used in topological data analysis and those of optimal transport, an optimal-transport based formalism to study persistence diagrams and similar topological descriptors has yet to come.…
Let $X_1,\ldots,X_n$ be an i.i.d. sample from symmetric stable distribution with stability parameter $\alpha$ and scale parameter $\gamma$. Let $\varphi_n$ be the empirical characteristic function. We prove an uniform large deviation…
As well-known, inner functions play an important role in the study of bounded analytic function theory. In recent years, persistence module theory, as a main tool applied to Topological Data Analysis, has received widespread attention. In…