Related papers: Reproducing Kernel Hilbert Spaces for Virtual Pers…
The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…
In this paper we analyze the covariance kernel of the Gaussian process that arises as the limit of fluctuations of linear spectral statistics for Wigner matrices with a few moments. More precisely, the process we study here corresponds to…
Operator-Valued Kernels (OVKs) and associated vector-valued Reproducing Kernel Hilbert Spaces provide an elegant way to extend scalar kernel methods when the output space is a Hilbert space. Although primarily used in finite dimension for…
Multiparameter persistence modules come up naturally in topological data analysis and topological robotics. Given a metric graph $(X,\delta)$, the second configuration space of $(X,\delta)$ with proximity parameters (for example, the…
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…
Persistence diagrams are important tools in the field of topological data analysis that describe the presence and magnitude of features in a filtered topological space. However, current approaches for comparing a persistence diagram to a…
Reproducing kernel Hilbert spaces are uniquely characterized by their kernel, but reproducing kernel Banach spaces (RKBS) are not. However, a characterization of which RKBS admit a given kernel as reproducing kernel is lacking. This work…
We generalize the SiZer of Chaudhuri and Marron (J. Amer. Statist. Assoc. 94 (1999) 807-823, Ann. Statist. 28 (2000) 408-428) for the detection of shape parameters of densities on the real line to the case of circular data. It turns out…
Kernel-based non-linear dimensionality reduction methods, such as Local Linear Embedding (LLE) and Laplacian Eigenmaps, rely heavily upon pairwise distances or similarity scores, with which one can construct and study a weighted graph…
The purpose of this work is to explore the existence and properties of reproducing kernel Hilbert subspaces of $L^2(\C, \, d^2z/\pi)$ based on subsets of complex Hermite polynomials. The resulting coherent states (CS) form a family…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
In this paper we study the persistent homology associated with topological crackle generated by distributions with an unbounded support. Persistent homology is a topological and algebraic structure that tracks the creation and destruction…
In this paper, we investigate properties of a reproducing kernel Hilbert space of a group action. In particular, we introduce an equivalence relation on a compact Hausdorff space $X$, and consequently establish three equivalent definitions…
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances between diagrams is essential; however, computing these distances…
In this paper, we illustrate the effectiveness of reproducing kernel Hilbert space techniques in the study of composition operators. For weighted Hardy spaces on the unit disk, we characterize the composition operators whose adjoint is…
Compositional data, such as human gut microbiomes, consist of non-negative variables whose only the relative values to other variables are available. Analyzing compositional data such as human gut microbiomes needs a careful treatment of…
We analyze in this paper a random feature map based on a theory of invariance I-theory introduced recently. More specifically, a group invariant signal signature is obtained through cumulative distributions of group transformed random…
Kernels on graphs have had limited options for node-level problems. To address this, we present a novel, generalized kernel for graphs with node feature data for semi-supervised learning. The kernel is derived from a regularization…
Kernel mean embeddings have recently attracted the attention of the machine learning community. They map measures $\mu$ from some set $M$ to functions in a reproducing kernel Hilbert space (RKHS) with kernel $k$. The RKHS distance of two…