Related papers: Bow Metrics and Hyperbolicity
In this paper, we introduce the concept of quasihyperbolically visible spaces. As a tool, we study the connection between the Gromov boundary and the metric boundary.
The M\"obius metric $\delta_G$ is studied in the cases where its domain $G$ is an open sector of the complex plane. We introduce upper and lower bounds for this metric in terms of the hyperbolic metric and the angle of the sector, and then…
The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to that set are unique. A fault-tolerant metric basis is a…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
We show that the eccentricities (and thus the centrality indices) of all vertices of a $\delta$-hyperbolic graph $G=(V,E)$ can be computed in linear time with an additive one-sided error of at most $c\delta$, i.e., after a linear time…
It is shown that the Hilbert geometry $(D,h_D)$ associated to a bounded convex domain $D\subset \mathbb{E}^n$ is isometric to a normed vector space $(V,||\cdot ||)$ if and only if $D$ is an open $n$-simplex. One further result on the…
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…
Let $G=(V,E)$ be a finite connected graph with vertex set $V$ and edge set $E$, and let $U(G)$ be the set of all ultrametric spaces $(V,d_l)$ generated by vertex labelings $l\colon V \to \mathbb R^+$. We prove that the inequality $$ |D(V)|…
In this paper, we prove a number of results about pattern avoidance in graphs with bounded metric dimension or edge metric dimension. We show that the maximum possible number of edges in a graph of diameter $D$ and edge metric dimension $k$…
The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Let $G$ be embeddable on a surface whose Euler characteristic $\chi$ is as large as possible,…
A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…
For an n-vertex directed graph $G = (V,E)$, a $\beta$-\emph{shortcut set} $H$ is a set of additional edges $H \subseteq V \times V$ such that $G \cup H$ has the same transitive closure as $G$, and for every pair $u,v \in V$, there is a…
In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…
Object detection, for the most part, has been formulated in the euclidean space, where euclidean or spherical geodesic distances measure the similarity of an image region to an object class prototype. In this work, we study whether a…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
A {\em resolving set} for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\em metric dimension} of $\Gamma$ is the…
The metric backbone of a weighted graph is the union of all-pairs shortest paths. It is obtained by removing all edges $(u,v)$ that are not the shortest path between $u$ and $v$. In networks with well-separated communities, the metric…