Related papers: General Fragmentation Trees
Probability estimation is one of the fundamental tasks in statistics and machine learning. However, standard methods for probability estimation on discrete objects do not handle object structure in a satisfactory manner. In this paper, we…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…
We provide explicit conditions, in terms of the transition kernel of its driving particle, for a Markov branching process to admit a scaling limit toward a self-similar growth-fragmentation with negative index. We also derive a scaling…
In the present paper we define statistically self-similar sets, and, using a modification of method described K.J.Falconer find a Hausdorff dimension of a statistically self-similar set.
The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
Convergence of the Gauss resolution process for a complex singular foliation of dimension r is shown to be equivalent to finite type of a graded sheaf which is built using base (r+2) expansions of integers. As applications it is calculated…
We consider a Galton--Watson tree with offspring distribution $\nu$ of finite mean. The uniform measure on the boundary of the tree is obtained by putting mass $1$ on each vertex of the $n$-th generation and taking the limit $n\to \infty$.…
A class of simplified measures is constructed to capture the key features of generic spatio-temporally chaotic systems. A combined analytical and numerical investigation allows us to extablish the scaling beahviour of the fractal dimension…
A well studied family of random fractals called fractal percolation is discussed. We focus on the projections of fractal percolation on the plane. Our goal is to present stronger versions of the classical Marstrand theorem, valid for almost…
We obtain fractal Lipschitz-Killing curvature-direction measures for a large class of self-similar sets F in R^d. Such measures jointly describe the distribution of normal vectors and localize curvature by analogues of the higher order mean…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
In this work, we aim to advance the development of a fractal theory for sets of integers. The core idea is to utilize the fractal structure of $p$-adic integers, where $p$ is a prime number, and compare this with conventional densities and…
The Hausdorff fractal dimension has been a fast-to-calculate method to estimate complexity of fractal shapes. In this work, a modified version of this fractal dimension is presented in order to make it more robust when applied in estimating…
A simple method of calculating the Hausdorff-Besicovitch dimension of the Kronecker Product based fractals is presented together with a compact R script realizing it. The proposed new formula is based on traditionally used values of the…
By unifying three foundational principles of modern biology, we develop a mathematical framework to analyze the growing tree of life. Contrary to the static case, where the analogy between phylogenetic trees and the tree that grows in soil…
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…
In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…