Related papers: The Normalized Edit Distance with Uniform Operatio…
Node similarity is a fundamental problem in graph analytics. However, node similarity between nodes in different graphs (inter-graph nodes) has not received a lot of attention yet. The inter-graph node similarity is important in learning a…
This paper presents a unified metric-based framework for triangle geometric inequalities using barycentric coordinates. By interpreting classical inequalities as squared distances between points(a process termed metricization)we derive and…
The concept of distance rationalizability of social choice rules has been explored in recent years by several authors. We deal here with several foundational questions, and unify, correct, and generalize previous work. For example, we study…
This paper introduces a novel stability measure for edit distances between merge trees of piecewise linear scalar fields. We apply the new measure to various metrics introduced recently in the field of scalar field comparison in scientific…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…
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…
We propose a model for finding one-dimensional structure in a given measure. Our approach is based on minimizing an objective functional which combines the average-distance functional to measure the quality of the approximation and…
In this paper we consider the weighted $k$-Hamming and $k$-Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this paper we prove that for any $k\geq 2$ the DECIS-$k$-Hamming…
When are two collider events similar? Despite the simplicity and generality of this question, there is no established notion of the distance between two events. To address this question, we develop a metric for the space of collider events…
Normalized information distance (NID) uses the theoretical notion of Kolmogorov complexity, which for practical purposes is approximated by the length of the compressed version of the file involved, using a real-world compression program.…
The edit distance is a fundamental measure of sequence similarity, defined as the minimum number of character insertions, deletions, and substitutions needed to transform one string into the other. Given two strings of length at most $n$,…
The main purpose of this manuscript is to provide a short proof of the metrizability of $\mathcal{F}$-metric spaces introduced by Jleli and Samet in \cite[\, Jleli, M. and Samet, B., On a new generalization of metric spaces, J. Fixed Point…
The paper is devoted to the geometry of transportation cost spaces and their generalizations introduced by Melleray, Petrov, and Vershik (2008). Transportation cost spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein $1$…
The need to identify graphs with small structural distances from a query arises in domains such as biology, chemistry, recommender systems, and social network analysis. Among several methods for measuring inter-graph distance, Graph Edit…
We propose a fundamental metric for measuring the distance between two distributions. This metric, referred to as the decision-focused (DF) divergence, is tailored to stochastic linear optimization problems in which the objective…
In 2007 H. Long-Guang and Z. Xian, [H. Long-Guang and Z. Xian, Cone Metric Spaces and Fixed Point Theorems of Contractive Mapping, J. Math. Anal. Appl., 322(2007), 1468-1476], generalized the concept of a metric space, by introducing cone…
Almost 30 years ago, Zhang and Shasha (1989) published a seminal paper describing an efficient dynamic programming algorithm computing the tree edit distance, that is, the minimum number of node deletions, insertions, and replacements that…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
We introduce a crisp metric $d_M$ as the common limit of two different nets $(\Delta_{M,\lambda})$ and $(\delta_{M,\lambda})$ of crisp metrics induced by a fuzzy metric $M$ and prove that the existence of each of these limits is equivalent…