Related papers: A finite Hausdorff dimension for graphs
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
A finite metric space is called here distance degree regular if its distance degree sequence is the same for every vertex. A notion of designs in such spaces is introduced that generalizes that of designs in $Q$-polynomial distance-regular…
A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y) < c d(x,z) for all x<y<z in X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
The \emph{metric dimension} of a graph $G$, denoted by $\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let $G_1$ and $G_2$ be disjoint copies of a graph $G$…
In this paper, we present a characterization for the Hausdorff distance between two given algebraic curves in the $n$-dimensional space (parametrically or implicitly defined) to be finite. The characterization is related with the asymptotic…
In this short note, we show that, in any given metric space, every Lipschitz open-map image of every subset of a given metric space whose boundary is Hausdorff-null is Hausdorff-measurable with respect to the same dimension. The main…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
We review the motivation and fundamental properties of the Hausdorff dimension of metric spaces and illustrate this with a number of examples, some of which are expected and well-known. We also give examples where the Hausdorff dimension…
In the present paper we investigate the properties of the Hausdorff mapping $\mathcal{H}$, which takes each compact metric space to the space of its nonempty closed subspaces. It is shown that this mapping is nonexpanding (Lipschitz mapping…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…
We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…
The magnitude of metric spaces does not appear to possess a simple, convenient continuity property, and previous studies have presented affirmative results under additional constraints or weaker notions, as well as counterexamples. In this…
Mean Hausdorff dimension is a dynamical version of Hausdorff dimension. It provides a way to dynamicalize geometric measure theory. We pick up the following three classical results of fractal geometry. (1) The calculation of Hausdorff…