Related papers: Additive functionals of $d$-ary increasing trees
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…
The limit distribution of the total cost incurred by splitting a tree uniformly distributed on the set of all finite free trees, appears as an additive functional induced by a toll equal to the square of the size of tree. The main tools…
The aim of this paper is twofold. On one hand, the additive solvability of the system of functional equations \[d_{k}(xy)=\sum_{i=0}^{k}\Gamma(i,k-i) d_{i}(x)d_{k-i}(y) \qquad (x,y\in \R,\,k\in\{0,\ldots,n\}) \] is studied, where…
This work establishes the existence of addition theorems and double-angle formulas for Ck real scalar functions. Moreover, we determine necessary and sufficient conditions for a bivariate function to be an addition formula for a Ck real…
An increasing 1,2-tree is a labeled graph formed by starting with a vertex and then repeatedly attaching a leaf to a vertex or a triangle to an edge, the labeling of the vertices corresponding to the order in which the vertices are added.…
Let $X$ and $Y$ be locally compact Hausdorff spaces. We denote by $C_0^+(X)$ the positive cone of all real-valued continuous functions on $X$ vanishing at infinity. In this paper, we consider a bijection $T\colon C_0^+(X) \to C_0^+(Y)$…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…
We prove functional limit theorems for dynamical systems in the presence of clusters of large values which, when summed and suitably normalised, get collapsed in a jump of the limiting process observed at the same time point. To keep track…
We consider the asymptotics of various estimators based on a large sample of branching trees from a critical multi-type Galton-Watson process, as the sample size increases to infinity. The asymptotics of additive functions of trees, such as…
Consider a rooted N-ary tree. For every vertex of this tree, we atttach an i.i.d. Bernoulli random variable. A path is called open if all the random variables that are assigned on the path are 1. We consider limiting behaviors for the…
Bayesian Additive Regression Trees (BART) is a tree-based machine learning method that has been successfully applied to regression and classification problems. BART assumes regularisation priors on a set of trees that work as weak learners…
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…
We provide a fundamental result for bucket increasing trees, which gives a complete characterization of all families of bucket increasing trees that can be generated by a tree evolution process. We also provide several equivalent…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
We obtain a differential equation for the enumeration of the path length of general increasing trees. By using differential operators and their combinatorial interpretation we give a bijective proof of a version of Fa\`a di Bruno formula,…
The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…
Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly $b$ children, with $b \ge 3$. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the…