相关论文: Asymptotic dimension of minor-closed families and …

We introduce the group-compact coarse structure on a Hausdorff topological group in the context of coarse structures on an abstract group which are compatible with the group operations. We develop asymptotic dimension theory for the…

In this paper we consider nonnegatively curved finite dimensional Alexandrov spaces with a non-collapsing condition, i.e., such that unit balls have volumes uniformly bounded from below away from zero. We study the relation between the…

A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

We construct a class of metric spaces whose transfinite asymptotic dimension and complementary-finite asymptotic dimension are both $\omega+k$ for any $k\in\mathbb{N}$, where $\omega$ is the smallest infinite ordinal number and a metric…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…

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…

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

A resolving set $S$ of a graph $G$ is a subset of its vertices such that no two vertices of $G$ have the same distance vector to $S$. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a…

The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…

We consider the family of graphs whose vertex set is Z^k where two vertices are connected by an edge when their l\infty-distance is 1. We prove the optimal vertex isoperimetric inequality for this family of graphs. That is, given a positive…

We develop a method to bound the dynamic asymptotic dimension of isometric group actions $\Gamma\curvearrowright X$ in terms of the asymptotic dimension of a space of graphs similar to a box space of $\Gamma$ (which also determines…

Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…

Given a pointed metric space $(X,\mathsf{dist}, w)$ on $n$ points, its Gromov's approximating tree is a 0-hyperbolic pseudo-metric space $(X,\mathsf{dist}_T)$ such that $\mathsf{dist}(x,w)=\mathsf{dist}_T(x,w)$ and $\mathsf{dist}(x, y)-2…

A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…

Gromov hyperbolicity of a metric space measures the distance of the space from a perfect tree-like structure. The measure has a "worst-case" aspect to it, in the sense that it detects a region in the space which sees the maximum deviation…

A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

We introduce the notion of pseudo-cones of metric spaces as a generalization of both of the tangent cones and the asymptotic cones. We prove that the Assouad dimension of a metric space is bounded from below by that of any pseudo-cone of…