In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
Javanian, M., & Vahidi Asl, M. Q. (2012). Branches in random recursive k-ary trees. Bulletin of the Iranian Mathematical Society, 38(2), 323-331.
MLA
Mehri Javanian; Mohammad Q. Vahidi Asl. "Branches in random recursive k-ary trees". Bulletin of the Iranian Mathematical Society, 38, 2, 2012, 323-331.
HARVARD
Javanian, M., Vahidi Asl, M. Q. (2012). 'Branches in random recursive k-ary trees', Bulletin of the Iranian Mathematical Society, 38(2), pp. 323-331.
VANCOUVER
Javanian, M., Vahidi Asl, M. Q. Branches in random recursive k-ary trees. Bulletin of the Iranian Mathematical Society, 2012; 38(2): 323-331.
)