Related papers: Metric hypergraphs and metric-line equivalences

This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…

For a metric space $X$ we study metrics on the two copies of $X$. We define composition of such metrics and show that the equivalence classes of metrics are a semigroup $M(X)$ Our main result is that $M(X)$ is an inverse semigroup,…

A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…

This is a write-up of a talk given at the CATMI meeting in Bergen in July 2023, and is an introduction to a category-theoretic perspective on metric spaces. A metric space is a set of points such that between each pair of points there is a…

In this paper we develop a measure-theoretic method to treat problems in hypergraph theory. Our central theorem is a correspondence principle between three objects: An increasing hypergraph sequence, a measurable set in an ultraproduct…

Let $(X_1,d_1),\dots, (X_N,d_N)$ be metric spaces, where $d_i: X_i \times X_i \rightarrow [0,1]$ is a distance function for $i=1,\dots,N$. Let $\mathcal{X}$ denote the set theoretic product $X_1\times \cdots \times X_N$. Let $\mathcal{G} =…

We make a systematic study of frames for metric spaces. We prove that every separable metric space admits a metric $\mathcal{M}_d$-frame. Through Lipschitz-free Banach spaces we show that there is a correspondence between frames for metric…

A line multigraph is obtained from a hypergraph as follows: the vertices of the multigraph correspond to the hyperedges of the hypergraph, and the number of edges between two vertices is given by the number of vertices shared by the…

The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however…

Metric approximate categories, or metagories, for short, are metrically enriched graphs. Their structure assigns to every directed triangle in the graph a value which may be interpreted as the area of the triangle; alternatively, as the…

A generalization of metric space is presented which is shown to admit a theory strongly related to that of ordinary metric spaces. To avoid the topological effects related to dropping any of the axioms of metric space, first a new, and…

Let $G=(V,E)$ be a connected graph and let $d(u,v)$ denote the distance between vertices $u,v \in V$. A metric basis for $G$ is a set $B\subseteq V$ of minimum cardinality such that no two vertices of $G$ have the same distances to all…

This paper is about similarity between objects that can be represented as points in metric measure spaces. A metric measure space is a metric space that is also equipped with a measure. For example, a network with distances between its…

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W=\{\omega_1, \dots , \omega_n\}\subset V(G)$ is the vector of distances $r(u\vert W)=(d(u,\omega_1), \dots , d(u,\omega_n))$. A vertex…

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…

We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum…

For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where…