A regular tree network's topology is characterized by two parameters: the branching,
, are given by [3] Three parameters are crucial in determining the statistics of random tree networks, first, the branching probability, second the maximum number of allowed progenies at each branching point, and third the maximum number of generations, that a tree can attain.
There are a lot of studies that address the large tree networks, however small tree networks are seldom studied.
[4] A group at MIT has developed a set of functions for Matlab that can help in analyzing the networks.
"MIT Strategic Engineering Research Group (SERG), Part II".