Related papers: Statistical analysis of Mapper for stochastic and …
Reeb graphs are an important tool for abstracting and representing the topological structure of a function defined on a manifold. We have identified three properties for faithfully representing Reeb graphs in a visualization: they should be…
We provide a development that unifies, simplifies and extends considerably a number of minimax results in the restricted parameter space literature. Various applications follow, such as that of estimating location or scale parameters under…
We present MCRapper, an algorithm for efficient computation of Monte-Carlo Empirical Rademacher Averages (MCERA) for families of functions exhibiting poset (e.g., lattice) structure, such as those that arise in many pattern mining tasks.…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams…
We develop a comprehensive theory for a general class of multi-parameter function spaces of Besov-Triebel-Lizorkin type, with a matrix weight. We prove the equivalence of different quasi-norms, the identification of function and sequence…
We develop a matricial version of Rieffel's Gromov-Hausdorff distance for compact quantum metric spaces within the setting of operator systems and unital C*-algebras. Our approach yields a metric space of ``isometric'' unital complete order…
The Mat\'ern covariance function is a popular choice for modeling dependence in spatial environmental data. Standard Mat\'ern covariance models are, however, often computationally infeasible for large data sets. In this work, recent results…
In this paper, we introduce an extension of smoothing on Reeb graphs, which we call truncated smoothing; this in turn allows us to define a new family of metrics which generalize the interleaving distance for Reeb graphs. Intuitively, we…
Theoretical studies have proven that the Hilbert space has remarkable performance in many fields of applications. Frames in tensor product of Hilbert spaces were introduced to generalize the inner product to high-order tensors. However,…
We present a unified theoretical framework for parametric low-rank approximation, a research area devoted to the development of efficient algorithms that act as adaptive alternatives of traditional methods such as Singular Value…
This paper analyzes the convergence for a large class of Riemannian stochastic approximation (SA) schemes, which aim at tackling stochastic optimization problems. In particular, the recursions we study use either the exponential map of the…
We combine the pointed Gromov-Hausdorff metric [Ron10] with the locally $C^0$ distance to obtain the pointed $C^0$-Gromov-Hausdorff distance between maps of possibly different non-compact pointed metric spaces. The latter is then combined…
We construct a family of non-parametric (infinite-dimensional) manifolds of finite measures on $R^d$. The manifolds are modelled on a variety of weighted Sobolev spaces, including Hilbert-Sobolev spaces and mixed-norm spaces. Each supports…
Given a metric space $X$ and a function $f: X \to \mathbb{R}$, the Reeb construction gives metric a space $X_f$ together with a quotient map $X \to X_f$. Under suitable conditions $X_f$ becomes a metric graph and can therefore be used as a…
The performance of space-time adaptive processing (STAP) is often degraded by factors such as limited sample size and moving targets. Traditional clutter covariance matrix (CCM) estimation relies on Euclidean metrics, which fail to capture…
Spatio-temporal data sets are rapidly growing in size. For example, environmental variables are measured with ever-higher resolution by increasing numbers of automated sensors mounted on satellites and aircraft. Using such data, which are…
Many natural Markov chains fail to mix to their stationary distribution in polynomially many steps. Often, this slow mixing is inevitable since it is computationally intractable to sample from their stationary measure. Nevertheless, Markov…
Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…