Related papers: General Fragmentation Trees
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
We show that the Hausdorff dimension of the closure of the second Grigorchuk group is 43/128. Furthermore we establish that the second Grigorchuk group is super strongly fractal and that its automorphism group equals its normaliser in the…
We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…
The paper concerns the image, level and sojourn time sets associated with sample paths of the Rosenblatt process. We obtain results regarding the Hausdorff (both classical and macroscopic), packing and intermediate dimensions, and the…
Fractals are self-repeating patterns which have dimensions given by fractions rather than integers. While the dimension of a system unambiguously defines its properties, a fractional dimensional system can exhibit interesting properties.…
Fine regularity of stochastic processes is usually measured in a local way by local H\"older exponents and in a global way by fractal dimensions. Following a previous work of Adler, we connect these two concepts for multiparameter Gaussian…
The purpose of the present work is twofold. First, we develop the theory of general self-similar growth-fragmentation processes by focusing on martingales which appear naturally in this setting and by recasting classical results for…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
The fractal structure of real world objects is often analyzed using digital images. In this context, the compression fractal dimension is put forward. It provides a simple method for the direct estimation of the dimension of fractals stored…
The metric space of phylogenetic trees defined by Billera, Holmes, and Vogtmann, which we refer to as BHV space, provides a natural geometric setting for describing collections of trees on the same set of taxa. However, it is sometimes…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
We show that any compact, connected set $K$ in the plane can be approximated by the critical points of a polynomial with two critical values. Equivalently, $K$ can be approximated in the Hausdorff metric by a true tree in the sense of…
We explore statistical inference in self-similar conservative fragmentation chains when only approximate observations of the sizes of the fragments below a given threshold are available. This framework, introduced by Bertoin and Martinez…
We consider a multitype Galton-Watson process that allows for the mutation and reversion of individual types in discrete and continuous time. In this setting, we explicitly compute the time evolution of quantities such as the mean and…
The pattern of formation of resonant frequency clusters in idealized sympodial dichasium trees is revealed by numerical modeling and analysis. The larger cluster's cardinality correlates with that of a Small World Network, which share the…
This note presents a simple criterion for the tightness of stochastic fragmentation processes. Our work is motivated by an application to a fragmentation process derived from deleting edges in a conditioned Galton-Watson tree studied by…