Related papers: Quasi-isometries between graphs with variable edge…
The article is devoted to the study of mappings with finite distortion in metric spaces. Analogues of results relating to equicontinuity and normality of families of quasiregular mappings are obtained. It is proved that the indicated…
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another. It is NP-hard to compute in general, and a…
Graph coarsening is a technique for solving large-scale graph problems by working on a smaller version of the original graph, and possibly interpolating the results back to the original graph. It has a long history in scientific computing…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…
Quantifying the similarity between two graphs is a fundamental algorithmic problem at the heart of many data analysis tasks for graph-based data. In this paper, we study the computational complexity of a family of similarity measures based…
In this paper, we first prove that any power quasi-symmetry of two metric spaces induces a rough quasi-isometry between their infinite hyperbolic cones. Second, we prove that for a complete metric space $Z$, there exists a point $\omega$ in…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
We explore the interplay between different definitions of distortion for mappings $f\colon X\to \mathbb{R}^2$, where $X$ is any metric surface, meaning that $X$ is homeomorphic to a domain in $\mathbb{R}^2$ and has locally finite…
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for…
We consider the problem of distortion minimal morphing of $n$-dimensional compact connected oriented smooth manifolds without boundary embedded in $\R^{n+1}$. Distortion involves bending and stretching. In this paper, minimal distortion…
We construct a quasiconformal mapping of $n$-dimensional Euclidean space, $n \geq 2$, that simultaneously distorts the Hausdorff dimension of a nearly maximal collection of parallel lines by a given amount. This answers a question of…
In this paper we study quasi-symmetric conjugations of $C^2$ weakly order-preserving circle maps with a flat interval. Under the assumption that the maps have the same rotation number of bounded type and that bounded geometry holds we…
In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…
Models for near-rigid shape matching are typically based on distance-related features, in order to infer matches that are consistent with the isometric assumption. However, real shapes from image datasets, even when expected to be related…
We prove an analogue of Farb-Masur's theorem that the length-spectra metric on moduli space is "almost isometric" to a simple model $\mathcal {V}(S)$ which is induced by the cone metric over the complex of curves. As an application, we know…
We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional…
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…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…