Related papers: A finite Hausdorff dimension for graphs
The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph's metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This…
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…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…
We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\delta $. A countable dense set in a…
Bounded-cohomological dimension of groups is a relative of classical cohomological dimension, defined in terms of bounded cohomology with trivial coefficients instead of ordinary group cohomology. We will discuss constructions that lead to…
In this paper, we consider non-normal numbers occurring in dynamical systems fulfilling the specification property. It has been shown that in this case the set of non-normal numbers has measure zero. In the present papers we show that a…
We investigate graph-directed iterated function systems in mixed Euclidean and p-adic spaces. Hausdorff measure and Hausdorff dimension in such spaces are defined, and an upper bound for the Hausdorff dimension is obtained. The relation…
We introduce two spectral invariants of finite metric spaces, the $q$-spectrum and the transition $q$-spectrum, defined from similarity matrices. These invariants extend the adjacency and Laplacian spectra of graphs to general finite metric…
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for graphs. It preserves the dimension of a subbasis, cohomology and Euler characteristic. Connectivity and homotopy look as in classical…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. More recently, the Frechet distance has been generalized to a…
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…
We are going to widen the scope of the previously defined Hausdorff-integral in two ways. First, in the sense, that we develop the theory of the integral on some naturally generalized measure spaces. Second, we extend it to functions taking…
Similarity measures are used extensively in machine learning and data science algorithms. The newly proposed graph Relative Hausdorff (RH) distance is a lightweight yet nuanced similarity measure for quantifying the closeness of two graphs.…
Compact metric spaces form an important class of metric spaces, but the category that they define lacks many important properties such as completeness and cocompleteness. In recent studies of "metric domain theory" and Stone-type dualities,…
In the present article we describe how one can define Hausdorff measure allowing empty elements in coverings, and using infinite countable coverings only. In addition, we discuss how the use of different nonequivalent interpretations of the…
We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…
Hausdorff dimension results are a classical topic in the study of path properties of random fields. This article presents an alternative approach to Hausdorff dimension results for the sample functions of a large class of self-affine random…
Let $G$ be a connected graph. Given an ordered set $W = \{w_1, w_2,\dots w_k\}\subseteq V(G)$ and a vertex $u\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\dots,$ $d(u,w_k))$, where…