Related papers: Subtractive random forests
For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$. In doing so, we…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
This paper presents a brand new nonparametric density estimation strategy named the best-scored random forest density estimation whose effectiveness is supported by both solid theoretical analysis and significant experimental performance.…
A random forest is a popular tool for estimating probabilities in machine learning classification tasks. However, the means by which this is accomplished is unprincipled: one simply counts the fraction of trees in a forest that vote for a…
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a rooted binary random tree $T_n$ with $n$ leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of…
For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…
We introduce a natural way to construct a random subset of a homogeneous Cantor set $C$ in $[0,1]$ via random labelings of an infinite $M$-ary tree, where $M\geq 2$. The Cantor set $C$ is the attractor of an equicontractive iterated…
Using generating functions techniques we develop a relation between the Hausdorff and spectral dimension of trees with a unique infinite spine. Furthermore, it is shown that if the outgrowths along the spine are independent and identically…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…
For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…
We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the…
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…
Let $G$ be a graph on $n$ vertices. For $i\in \{0,1\}$ and a connected graph $G$, a spanning forest $F$ of $G$ is called an $i$-perfect forest if every tree in $F$ is an induced subgraph of $G$ and exactly $i$ vertices of $F$ have even…
We investigate the statistics of extremal path(s) (both the shortest and the longest) from the root to the bottom of a Cayley tree. The lengths of the edges are assumed to be independent identically distributed random variables drawn from a…
We deal with a sequence of integer-valued random variables $\{Z_N\}_{N=1}^{\infty}$ which is related to restricted partitions of positive integers. We observe that $Z_N=X_1+ \ldots + X_N$ for independent and bounded random variables…
We consider a random forest $\mathcal{F}^*$, defined as a sequence of i.i.d. birth-death (BD) trees, each started at time 0 from a single ancestor, stopped at the first tree having survived up to a fixed time $T$. We denote by…
In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…
We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain…