References
- D. Y. C. Chan, B. D. Hughes, A. S. Leong, W. J. Reed, Stochasticaly evolving networks, Phys. Rev. E, 68 (2003), 24.
- B. Chauvin, T. Klein, J. Marckert, A. Rouault, Martingales and Profile of Binary Search Trees. Electronic Journal of Probability, 10 (2005), 420-435.
- R. Dobrow, and R. Smythe, Poisson approximations for functionals of random trees. Random Structures Algorithms, 9 (1996), 79-92.
- Q. Feng, C. Su, The structure and distances in Yule recursive trees Random Struct. Algorithms, 31 (2007), 273-287.
- J. L. Gastwirth, P. K. Bhattacharya, Two probability models of pyramids or chain letter schemes demonstrating that their promotional claims are unreliable. Operations Research, 32 (1984), 527-536.
- H. Mahmoud, R. T. Smythe, A survey of recursive trees, Theory Probab. Math. Statist., 51 (1995), 1-27.
- S. M. Ross, Stochastic processes, Wiley, New York, 1983.