Related papers: General Fragmentation Trees
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
Hausdorff measure and Hausdorff dimension are useful tools to describe fractals. This paper investigates the bounds on the $d\log_32$-dimensional Hausdorff measure of the $d$-fold Cartesian product of the $1/3$ Cantor set, $\mathcal C^d$.…
We propose a stochastic model of a fragmentation process, developed by taking into account fragment lifetime as a function of their size based on the Gibrat process. If lifetime is determined by a power function of fragment size, numerical…
We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution…
We study dimensional properties of visible parts of fractal percolation in the plane. Provided that the dimension of the fractal percolation is at least 1, we show that, conditioned on non-extinction, almost surely all visible parts from…
A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound \Delta (a parameter of the theory) is unrestricted, the resulting dimension is precisely the…
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…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete…
Growth-fragmentation processes describe the evolution of systems of cells which grow continuously and fragment suddenly; they are used in models of cell division and protein polymerisation. Typically, we may expect that in the long run, the…
We investigate several aspects of the Assouad dimension and the lower dimension, which together form a natural `dimension pair'. In particular, we compute these dimensions for certain classes of self-affine sets and quasi-self-similar sets…
We give upper and lower bounds for the Hausdorff dimensions for a class of graph-directed measures when its underlying directed graph is the infinite N-ary tree. These measures are different from graph-directed self-similar measures driven…
We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…
Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…
We compute the Hausdorff dimension of sets defined by the growth of weighted products of multiple digits at arbitrary positions in $d$-decaying Gauss-like iterated function systems. We provide the complete Hausdorff dimensional result for…
We investigate Benford's law in relation to fractal geometry. Basic fractals, such as the Cantor set and Sierpinski triangle are obtained as the limit of iterative sets, and the unique measures of their components follow a geometric…
The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established…
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…
In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…