Related papers: General Fragmentation Trees
Trees continue to fascinate with their natural beauty and as engineering masterpieces optimal with respect to several independent criteria. Pythagorean tree is a well-known fractal design that realistically mimics the natural tree branching…
Phylogenetic trees are a central tool in understanding evolution. They are typically inferred from sequence data, and capture evolutionary relationships through time. It is essential to be able to compare trees from different data sources…
Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we…
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
We consider the fragmentation process with mass loss and discuss self-similar properties of the arising structure both in time and space, focusing on dimensional analysis. This exhibits a spectrum of mass exponents $\theta$, whose exact…
We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. Under a mild separation condition, we show that the Hausdorff and box dimensions of the attractor are equal to the minimum of 1…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
The fractal or Hausdorff dimension is a measure of roughness (or smoothness) for time series and spatial data. The graph of a smooth, differentiable surface indexed in $\mathbb{R}^d$ has topological and fractal dimension $d$. If the surface…
Let $\mathcal{T}$ be a rooted tree endowed with the natural partial order $\preceq$. Let $(Z(v))_{v\in \mathcal{T}}$ be a sequence of independent standard Gaussian random variables and let $\alpha = (\alpha_k)_{k=1}^\infty$ be a sequence of…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
We study the conformal dimension of fractal percolation and show that, almost surely, the conformal dimension of a fractal percolation is strictly smaller than its Hausdorff dimension.
We construct random locally compact real trees called Levy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton-Watson trees with i.i.d.…
Growth-fragmentation processes model the evolution of positive masses which undergo binary divisions. The aim of this paper is twofold. First, we extend the theory of growth-fragmentation processes to allow signed mass. Among others, we…
We study derivations and Fredholm modules on metric spaces with a local regular conservative Dirichlet form. In particular, on finitely ramified fractals, we show that there is a non-trivial Fredholm module if and only if the fractal is not…
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…
We study a branching-process random iterated function system (RIFS) defined by a recursive replacement of leaves by finite subtrees at strictly smaller contraction scales. This construction yields a tree-valued, infinite-depth random…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
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…