Related papers: Trees, Tight-Spans and Point Configuration
Multidimensional Scaling (MDS) is one of the first fundamental manifold learning methods. It can be categorized into several methods, i.e., classical MDS, kernel classical MDS, metric MDS, and non-metric MDS. Sammon mapping and Isomap can…
Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there exist first order convergent sequences of graphs with no…
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…
Given a parameter dependent fixed point equation $x = F(x,u)$, we derive an abstract compactness principle for the fixed point map $u \mapsto x^*(u)$ under the assumptions that (i) the fixed point equation can be solved by the contraction…
The Reeb space, which generalizes the notion of a Reeb graph, is one of the few tools in topological data analysis and visualization suitable for the study of multivariate scientific datasets. First introduced by Edelsbrunner et al., it…
In this paper, we study the existence of fixed points for mappings defined on complete, (sequentially compact) cone metric spaces, satisfying a general contractive inequality depending of two additional mappings.
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
The Fermat-Weber location problem requires finding a point in $\mathbb{R}^n$ that minimizes the sum of weighted Euclidean distances to $m$ given points. An iterative solution method for this problem was first introduced by E. Weiszfeld in…
In this paper we study the relationship between a very classical algebraic object associated to a filtration of spaces, namely a spectral sequence introduced by Leray in the 1940's, and a more recently invented object that has found many…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
In this paper, we revisit the notion of length measures associated to planar closed curves. These are a special case of area measures of hypersurfaces which were introduced early on in the field of convex geometry. The length measure of a…
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…
A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
Stereophotogrammetry is an established technique for scene understanding. Its origins go back to at least the 1800s when people first started to investigate using photographs to measure the physical properties of the world. Since then,…
We develop a novel probabilistic approach for multi-label classification that is based on the mixtures-of-experts architecture combined with recently introduced conditional tree-structured Bayesian networks. Our approach captures different…
In this article we extend the notion of orthogonal metric space to weak orthogonal metric space. Then we establish fixed point results for a mapping satisfying a more general contraction condition. Several nontrivial examples are given in…
In the finite-dimensional case, we present a new approach to the theory of cones with a mapping cone symmetry, first introduced by St{\o}rmer. Our method is based on a definition of an inner product in the space of linear maps between two…
We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…
We address the problem of reconstructing a set of points on a line or a loop from their unassigned noisy pairwise distances. When the points lie on a line, the problem is known as the turnpike; when they are on a loop, it is known as the…