Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

RSA
2006

favoriteEmaildiscussreport

78views more RSA 2006»

Nodes of large degree in random trees and forests

13 years 4 months ago

Nodes of large degree in random trees and forests

Download dmg.tuwien.ac.at

We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is shown that Nk,n is asymptotically normal if ENk,n and asymptotically Poisson distributed if ENk,n C > 0. If ENk,n 0, then the distribution degenerates. The same holds for rooted, unlabeled trees and forests.

Bernhard Gittenberger

Real-time Traffic

Asymptotic Behaviour | Random Trees | RSA 2006 | Tree Size |

claim paper

Related Content

» An incremental extremely random forest classifier for online learning and tracking

» Using Random Forests in the Structured Language Model

» Language model adaptation using Random Forests

» On the degree distribution of the nodes in increasing trees

» First Order Random Forests with Complex Aggregates

» Decision Tree Ensemble Small Heterogeneous Is Better Than Large Homogeneous

» Random Forest for Gene Expression Based Cancer Classification Overlooked Issues

» Fuzzy Tree Mining Go Soft on Your Nodes

» The shape of unlabeled rooted random trees

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2006
Where	RSA
Authors	Bernhard Gittenberger

Comments (0)