Related papers: Distance matrices and isometric embeddings
We show that countable metric spaces always have quantum isometry groups, thus extending the class of metric spaces known to possess such universal quantum-group actions. Motivated by this existence problem we define and study the notion of…
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae…
We treat the problem of the Frobenius distance evaluation from a given matrix $ A \in \mathbb R^{n\times n} $ with distinct eigenvalues to the manifold of matrices with multiple eigenvalues. On restricting considerations to the rank $ 1 $…
We prove that a quasi-isometric map, and more generally a coarse embedding, between pinched Hadamard manifolds is within bounded distance from a unique harmonic map.
We study isometric embeddings of some solutions of the Einstein equations with suffciently high symmetries into a flat ambient space. We briefly describe a method for constructing surfaces with a given symmetry. We discuss all minimal…
A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…
We define inductively isometric embeddings of $\mb{P}^n(\mb{R})$ and $\mb{P}^n(\mb{C})$ (with their canonical metrics conveniently scaled) into the standard unit sphere, which present the former as the restriction of the latter to the set…
This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddings like multidimensional scaling (MDS) or Isomap, but…
We prove that each sub-Riemannian manifold can be embedded in some Euclidean space preserving the length of all the curves in the manifold. The result is an extension of Nash $C^1$ Embedding Theorem. For more general metric spaces the same…
Sequence comparison is a basic task to capture similarities and differences between two or more sequences of symbols, with countless applications such as in computational biology. An alignment is a way to compare sequences, where a giving…
We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense,…
We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive…
Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We overview the theory of classical MDS, along with its…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…
The embedding theorem arises in several problems from analysis and geometry. The purpose of this paper is to provide a deeper understanding of analysis and geometry with a particular focus on embedding theorems on spaces of homogeneous type…
We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…
A study is made of linear isometries on Fr\'echet spaces for which the metric is given in terms of a sequence of seminorms. This establishes sufficient conditions on the growth of the function that defines the metric in terms of the…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
We study the isoperimetric problem in product spaces equipped with the uniform distance. Our main result is a characterization of isoperimetric inequalities which, when satisfied on a space, are still valid for the product spaces, up a to a…