Related papers: Metric spaces and sparse graphs

Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…

A labeled metric space is intuitively speaking a metric space together with a special set of points to be understood as the geometric boundary of the space. We study basic properties of a recently introduced labeled Gromov-Hausdorff…

We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…

The paper introduces the class of O-metric spaces, a novel generalization of metric-type spaces, classifying almost all possible metric types into upward and downward O-metrics. We list some topologies arising from O-metrics and discuss…

Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…

We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…

In this work we show that any connected locally connected graph defines a metric space having at least as many lines as vertices with only three exception: the complete multipartite graphs $K_{1,2,2}$, $K_{2,2,2}$ and $K_{2,2,2,2}$. This…

A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…

The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. More recently, the Frechet distance has been generalized to a…

The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…

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…

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…

A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

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…

Given a metric space $(X, \rho)$, we say $y$ is between $x$ and $z$ if $\rho(x,z) = \rho(x,y) + \rho(y,z)$. A metric space gives rise to a 3-uniform hypergraph that has as hyperedges those triples $\{ x,y,z \}$ where $y$ is between $x$ and…

A new method of metric space investigation, based on classification of its finite subspaces, is suggested. It admits to derive information on metric space properties which is encoded in metric. The method describes geometry in terms of only…