Highly Influenced

2 Excerpts

- Published 2001

Two types of random trees, “static” and “growing,” are studied. The “growing” type of trees is constructed with an ordering bias imposed on its population of N nodes. Exact formulas for the expected number of nodes of degree i are derived in each case. Asymptotic behavior of such formulas is determined for large values of N.

@inproceedings{NA2001DistributionON,
title={Distribution of Nodes of a Tree},
author={HWA SUNG NA and Anatol Rapoport},
year={2001}
}