Related papers: Hausdorff dimensions for graph-directed measures d…
In this paper, we study the topological entropy and the Hausdorff dimension of a shrinking target set. We give lower and upper bounds of topological entropy and Hausdorff dimension for dynamical systems with exponential specification…
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…
The increasing rate of the Birkhoff sums in the infinite iterated function systems with polynomial decay of the derivative (for example the Gauss map) is studied. For different unbounded potential functions, the Hausdorff dimensions of the…
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
In this paper we answer a question raised by David H. Fremlin about the Hausdorff measure of $\mathbb{R}^2$ with respect to a distance inducing the Euclidean topology. In particular we prove that the Hausdorff $n$-dimensional measure of…
Consider a sequence of linear contractions $S_{j}(x)=\varrho x+d_{j}$ and probabilities $p_{j}>0$ with $\sum p_{j}=1$. We are interested in the self-similar measure $\mu =\sum p_{j}\mu \circ S_{j}^{-1}$, of finite type. In this paper we…
We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…
We introduce the concept of a family of finite directed graphs (order 1) which are directed graphs derived from an infinite directed graph (order 1), called the 1-root digraph. The 1-root digraph has four fundamental properties which are;…
Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over $r$ letters with $r \neq 4i$ and $i \in \mathbb{N}$, a sequence of pointed finite graphs. We study the pointed Gromov-Hausdorff limit graphs…
We construct functions $f \colon [0,1] \to [0,1]$ whose graph as a subset of $\mathbb{R}^2$ has Hausdorff dimension greater than any given value $\alpha \in (1,2)$ but conformal dimension $1$. These functions have the property that a…
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…
In this paper, we first show that for all four non-negative real numbers, there exists a Cantor ultrametric space whose Hausdorff dimension, packing dimension, upper box dimension, and Assouad dimension are equal to given four numbers,…
This paper establishes connections between the group-Fourier transform and the geometry of measures in the Heisenberg group. Firstly, it is shown that if the Fourier transform of a compactly supported, finite, Radon measure is square…
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to…
We construct and study a family random continuum polymer measures $\mathbf{M}_{r}$ corresponding to limiting partition function laws recently derived in a weak-coupling regime of polymer models on hierarchical graphs with marginally…
A comprehensive theory of the effect of Orlicz-Sobolev maps, between Euclidean spaces, on subsets with zero or finite Hausdorff measure is offered. Arbitrary Orlicz-Sobolev spaces embedded into the space of continuous function and Hausdorff…
Let $\{a_n(x)\}_{n\geq1}$ be the sequence of digits of $x\in(0,1)$ in infinite iterated function systems with polynomial decay of the derivative. We first study the multifractal spectrum of the convergence exponent defined by the sequence…
We introduce the concept of a family of finite directed graphs (order a) which are directed graphs derived from an infinite directed graph (order a), called the a-root digraph. The a-root digraph has four fundamental properties which are;…
We study several fractal properties of the Weierstrass-type function \[ W(x)=\sum_{n=0} ^\infty \lambda (x) \lambda(\tau x) \cdots \lambda (\tau ^{n-1}x)\, g(\tau ^n x), \] where $\tau :[0,1)\to[0,1)$ is a cookie cutter map with possibly…
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…