Related papers: Hausdorff dimensions for graph-directed measures d…
The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…
We associate, with every infinite word over a finite alphabet, an increasing sequence of rooted finite graphs, which provide a discrete approximation of the famous Sierpi\'nski carpet fractal. Each of these sequences converges, in the…
We develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, we develop the thermodynamic formalism and show that, under…
We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions…
We study continuity and discontinuity properties of some popular measure-dimension mappings under some topologies on the space of probability measures in this work. We give examples to show that no continuity can be guaranteed under general…
We consider transcendental meromorphic function for which the set of finite singularities of its inverse is bounded. Bergweiler and Kotus gave bounds for the Hausdorff dimension of escaping sets if the function has no logarithmic…
We produce an upper bound for the Hausdorff dimension of the graph of a Weierstrass-type function. Whilst strictly weaker than existing results, it has the advantage of being directly computable from the theory of hyperbolic iterated…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
In this paper, we define several measures induced by a finite directed graph. The study themselves is interesting ont only in the noncommutative probability point of view but also in the algebraic structure point of view, since to define…
Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume…
We study probabilistic iterated function systems (IFS), consisting of a finite or infinite number of average-contracting bi-Lipschitz maps on R^d. If our strong open set condition is also satisfied, we show that both upper and lower bounds…
For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of standard (1-vertex directed graph) IFSs, with or without separation…
Upper bounds of the Hausdorff volume of scalar gradient field graphs are derived by means of geometric measure theory. The approach reproduces that scalar gradient fields along a mean imposed scalar gradient become space filling for…
In an earlier paper Buczolich, Elekes and the author introduced a new concept of dimension for metric spaces, the so called topological Hausdorff dimension. They proved that it is precisely the right notion to describe the Hausdorff…
This work introduces two new notions of dimension, namely the unimodular Minkowski and Hausdorff dimensions, which are inspired from the classical analogous notions. These dimensions are defined for unimodular discrete spaces, introduced in…
For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…
This paper is partly an exposition, and partly an extension of our work [1] to the multiparameter case. We consider certain classes of parametrized dynamically defined measures. These are push-forwards, under the natural projection, of…
Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking whether this relationship lifts to directed graphs -- we…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
In this work we study the Hausdorff dimension of measures whose weight distribution satisfies a markov non-homogeneous property. We prove, in particular, that the Hausdorff dimensions of this kind of measures coincide with their lower…