Related papers: Distance-squared mappings
The purpose of this paper is to give a survey on the notions of distance between subsets either of a metric space or of a measure space, including definitions, a classification, and a discussion of the best-known distance functions, which…
This paper investigates the geometry and singularities of parallel surfaces of cuspidal cross caps, the fundamental non-front frontal singularities. We establish a criterion for the degeneracy of the distance squared function in terms of…
We introduce a proximal subdifferential and develop a calculus for nonsmooth functions defined on any Riemannian manifold $M$. We give several applications of this theory, concerning: 1) differentiability and geometrical properties of the…
This work builds a unified framework for the study of quadratic form distance measures as they are used in assessing the goodness of fit of models. Many important procedures have this structure, but the theory for these methods is dispersed…
We introduce a novel formulation for geometry on discrete points. It is based on a universal differential calculus, which gives a geometric description of a discrete set by the algebra of functions. We expand this mathematical framework so…
Fold maps are fundamental tools in the theory of singularities of differentiable maps and its applications to geometry. They are higher dimensional variants of Morse functions. Classes of special generic maps and round fold maps are…
We introduce a neural implicit framework that exploits the differentiable properties of neural networks and the discrete geometry of point-sampled surfaces to approximate them as the level sets of neural implicit functions. To train a…
Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…
This paper investigates self-maps T from X to X which satisfy a distance constraint in a metric space which mixed point-dependent non-expansive properties, or in particular contractive ones, and potentially expansive properties related to…
Many functions have been recently defined to assess the similarity among networks as tools for quantitative comparison. They stem from very different frameworks - and they are tuned for dealing with different situations. Here we show an…
A k-dissimilarity map on a finite set X is a function D : X \choose k \rightarrow R assigning a real value to each subset of X with cardinality k, k \geq 2. Such functions, also sometimes known as k-way dissimilarities, k-way distances, or…
This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
In the dynamical triangulation model of 4D euclidean quantum gravity we measure two-point functions of the scalar curvature as a function of the geodesic distance. To get the correlations it turns out that we need to subtract a squared…
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…
If we are given a connected finite graph $G$ and a subset of its vertices $V_{0}$, we define a distance-residual graph as a graph induced on the set of vertices that have the maximal distance from $V_{0}$. Some properties and examples of…
The quantale of distance distributions is of fundamental importance for understanding probabilistic metric spaces as enriched categories. Motivated by the categorical interpretation of partial metric spaces, we are led to investigate the…
The paper deals with the problem of reconstructing the topological structure of a network of dynamical systems. A distance function is defined in order to evaluate the "closeness" of two processes and a few useful mathematical properties…