Title
On the number of trees in a random forest
Abstract
The analytic methods of Pólya, as reported in [1, 6] are used to determine the asymptotic behavior of the expected number of (unlabeled) trees in a random forest of order p. Our results can be expressed in terms of η = .338321856899208 …, the radius of convergence of t(x) which is the ordinary generating function for trees. We have found that the expected number of trees in a random forest approaches 1 + Σk=1∞ t(ηk) = 1.755510 … and the form of this result is the same
Year
DOI
Venue
1979
10.1016/0095-8956(79)90073-X
Journal of Combinatorial Theory, Series B
Keywords
Field
DocType
random forest
Generating function,Discrete mathematics,Notation,Combinatorics,Radius of convergence,Enumeration,Expected value,Random forest,Asymptotic analysis,Mathematics
Journal
Volume
Issue
ISSN
27
2
0095-8956
Citations 
PageRank 
References 
7
9.25
2
Authors
2
Name
Order
Citations
PageRank
Edgar M. Palmer14017.09
A. J. Schwenk26619.83