On the profile of random forests
From MaRDI portal
A random forest \(F\) consisting of \(n\) vertices and \(N\) rooted trees can be considered as a realization of a Galton-Watson process with \(N\) initial particles and conditioned to have total progeny \(n.\) Various limiting results are given for the number of vertices in generation \(k\) of \(F.\) Also multivariate results are given for several generations considered simultaneously. For the entire collection see [Zbl 0997.00016].
Recommendations
- Limit distributions of the number of vertices of a given out-degree in a random forest
- Limit distributions of the number of vertices in the layers of a random forest
- Limit distributions for the number of leaves in a random forest
- Limit distributions of the number of trees of a given size in a random forest
- Sizes of trees in a random forest and configuration graphs
Cited in
(13)- Reflected Brownian bridge local time conditioned on its local time at the origin
- Sizes of trees in a random forest and configuration graphs
- scientific article; zbMATH DE number 6378123 (Why is no real title available?)
- A Study of Strength and Correlation in Random Forests
- scientific article; zbMATH DE number 1222135 (Why is no real title available?)
- scientific article; zbMATH DE number 1261956 (Why is no real title available?)
- The degree profile of random Pólya trees
- Critical random forests
- Impact of subsampling and tree depth on random forests
- The maximum tree of a random forest in the configuration graph
- scientific article; zbMATH DE number 6781369 (Why is no real title available?)
- Subtractive random forests
- The shape of unlabeled rooted random trees
This page was built for publication: On the profile of random forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428914)