Related papers: On lower distance estimates of mappings in metric …
A behavior of one class of mappings with finite distortion at a neighborhood of the origin is investigated. There is proved a lower estimate of distortion of a distance under mappings mentioned above.
For mappings in metric spaces satisfying one inequality with respect to modulus of families of curves, there is proved a lightness of the uniform limit of these mappings. It is proved that, the uniform limit of these mappings is light…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
For mappings in metric spaces satisfying one inequality with respect to modulus of families of curves, there is proved a lightness of preimage under the mapping. It is proved that, the mappings, satisfying estimate mentioned above, are…
We consider mappings of domains of Riemannian manifolds that admit branch points and satisfy a certain condition regarding the distortion of the modulus of families of paths. We have established logarithmic estimates of distance distortion…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
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…
We study deterministic online embeddings of metrics spaces into normed spaces and into trees against an adaptive adversary. Main results include a polynomial lower bound on the (multiplicative) distortion of embedding into Euclidean spaces,…
We introduce a new intrinsic metric in subdomains of a metric space and give upper and lower bounds for it in terms of well-known metrics. We also prove distortion results for this metric under quasiregular maps.
We prove a dimension distortion estimate for mappings of sub-exponentially integrable distortion in Euclidean spaces, which is essentially sharp in the plane.
Open discrete mappings with a modulus condition in metric spaces are considered. Some results related to local behavior of mappings as well as theorems about continuous extension to a boundary are proved.
We consider mappings satisfying a certain estimate of the distortion of the modulus of families of paths, similar to the geometric definition of quasiconformal mappings. Under appropriate restrictions, we show that the class of such…
Distortion maps allow one to solve the Decision Diffie-Hellman problem on subgroups of points on the elliptic curve. In the case of ordinary elliptic curves over finite fields, it is known that in most cases there are no distortion maps. In…
Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…
A paper is devoted to study of one class of space mappings which are more general than mappings with bounded distortion. It is showed that a locally uniformly limit of a sequence of mappings $f:D\rightarrow {\Bbb R}^n$ of domain…
The merit of projecting data onto linear subspaces is well known from, e.g., dimension reduction. One key aspect of subspace projections, the maximum preservation of variance (principal component analysis), has been thoroughly researched…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…
We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…
Laplacian-based methods are popular for the dimensionality reduction of data lying in $\mathbb{R}^N$. Several theoretical results for these algorithms depend on the fact that the Euclidean distance locally approximates the geodesic distance…
We study the distinguishability notion given by Wootters for states represented by probability density functions. This presents the particularity that it can also be used for defining a distance in chaotic unidimensional maps. Based on that…