Related papers: Mixing and Merging Metric Spaces using Directed Gr…

A generator of a metric space is a set $S$ of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of $S$. Given a simple graph $G=(V,E)$, we define the distance…

For a fixed set $X$, an arbitrary \textit{weight structure} $d \in [0,\infty]^{X \times X}$ can be interpreted as a distance assignment between pairs of points on $X$. Restrictions (i.e. \textit{metric axioms}) on the behaviour of any such…

In mathematics education research, mathematics task sets involving mixed practice include tasks from many different topics within the same assignment. In this paper, we use graph decompositions to construct mixed practice task sets for…

We study the directed maximum common edge subgraph problem (DMCES) for the class of directed graphs that are finite, weakly connected, oriented, and simple. We use DMCES to define a metric on partially ordered sets that can be represented…

In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…

We investigate when the local Lipschitz property of the real-valued function $g(z) = d_Y (f(z),A)$ implies the global Lipschitz property of the mapping $f:X\to Y$ between the metric spaces $(X,d_X)$ and $(Y,d_Y)$. Here, $d_Y(y,A)$ denotes…

A metric space $(X,d)$ has the de Groot property $GP_n$ if for any points $x_0,x_1,...,x_{n+2}\in X$ there are positive indices $i,j,k\le n+2$ such that $i\ne j$ and $d(x_i,x_j)\le d(x_0,x_k)$. If, in addition, $k\in\{i,j\}$ then $X$ is…

This paper presents methods to compare high order networks, defined as weighted complete hypergraphs collecting relationship functions between elements of tuples. They can be considered as generalizations of conventional networks where only…

This paper prescribes a distance between learning tasks modeled as joint distributions on data and labels. Using tools in information geometry, the distance is defined to be the length of the shortest weight trajectory on a Riemannian…

A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation…

Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…

Let $G$ be a connected graph with vertex set $V(G)=\{v_{1},v_{2},...,v_{n}\}$. The distance matrix $D(G)=(d_{ij})_{n\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$…

Let $G$ be a finite, connected metric graph and let $X\subseteq G$ be a subset. If $X$ is sufficiently dense in $G$, we show that the Gromov--Hausdorff distance matches the Hausdorff distance, namely $d_\gh(G,X)=d_\h(G,X)$. When the metric…

We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

In this work, we define the concept of mixed $G$-monotone mappings defined on a metric space endowed with a graph. Then we obtain sufficient conditions for the existence of coupled fixed points for such mappings when a weak contractivity…

Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point…

We aim to find orientations of mixed graphs optimizing the total reachability, a problem that has applications in causality and biology. For given a digraph $D$, we use $P(D)$ for the set of ordered pairs of distinct vertices in $V(D)$ and…

The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by…

We investigate weighted Sobolev spaces on metric measure spaces $(X,d,m)$. Denoting by $\rho$ the weight function, we compare the space $W^{1,p}(X,d,\rho m)$ (which always concides with the closure $H^{1,p}(X,d,\rho m)$ of Lipschitz…