Related papers: Compactness and Measures of Noncompactness in Metr…
The Metric Dimension problem asks for a minimum-sized resolving set in a given (unweighted, undirected) graph $G$. Here, a set $S \subseteq V(G)$ is resolving if no two distinct vertices of $G$ have the same distance vector to $S$. The…
We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely identifying every vertex in a graph. A set of vertices in a graph is a resolving set if for any pair of vertices x and…
We are interested in measures of central tendency for a population on a network, which is modeled by a metric tree. The location parameters that we study are generalized Fr\'echet means obtained by minimizing the objective function $\alpha…
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
A graph $G=(V,E)$ with geodesic distance $d(\cdot,\cdot)$ is said to be resolved by a non-empty subset $R$ of its vertices when, for all vertices $u$ and $v$, if $d(u,r)=d(v,r)$ for each $r\in R$, then $u=v$. The metric dimension of $G$ is…
If $(X,d)$ is a metric space then the map $f\colon X\to X$ is defined to be a weak contraction if $d(f(x),f(y))<d(x,y)$ for all $x,y\in X$, $x\neq y$. We determine the simplest non-closed sets $X\subseteq \mathbb{R}^n$ in the sense of…
Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…
Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…
With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…
Noncommutative geometry is used to study the local geometry of ultrametric spaces and the geometry of trees at infinity. Connes's example of the noncommutative space of Penrose tilings is interpreted as a non-Hausdorff orbit space of a…
Motivated by persistent homology and topological data analysis, we consider formal sums on a metric space with a distinguished subset. These formal sums, which we call persistence diagrams, have a canonical 1-parameter family of metrics…
We study tree metrics that can be realized as a mixture of two star tree metrics. We prove that the only trees admitting such a decomposition are the ones coming from a tree with at most one internal edge, and whose weight satisfies certain…
The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A resolving set X of a graph G is a subset of vertices such…
In a metric space, such as the real numbers with their standard metric, a set A is open if and only if no sequence with terms outside of A has a limit inside A. Moreover, a metric space is compact if and only if every sequence has a…
The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…
In the evaluation of attribution quality, the quantitative assessment of explanation legibility is particularly difficult, as it is influenced by varying shapes and internal organization of attributions not captured by simple statistics. To…
We study the $SIG$ dimension of trees under $L_{\infty}$ metric and answer an open problem posed by Michael and Quint (Discrete Applied Mathematics: 127, pages 447-460, 2003). Let $T$ be a tree with atleast two vertices. For each $v\in…