Hostname: page-component-76fb5796d-22dnz Total loading time: 0 Render date: 2024-04-28T15:50:33.523Z Has data issue: false hasContentIssue false
  • English
  • Français

BUILDING RANDOM TREES FROM BLOCKS*

Published online by Cambridge University Press:  19 November 2013

M. Gopaladesikan ,
H. Mahmoud  and
M.D. Ward
M. Gopaladesikan
Affiliation:
Department of Statistics, Purdue University, West Lafayette, Indiana 47907. E-mail: mgopalad@purdue.edu
H. Mahmoud
Affiliation:
Department of Statistics, The George Washington University, Washington, D.C. 20052. E-mail: hosam@gwu.edu
M.D. Ward
Affiliation:
Department of Statistics, Purdue University, West Lafayette, Indiana 47907. E-mail: mdw@purdue.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

Many modern networks grow from blocks. We study the probabilistic behavior of parameters of a blocks tree, which models several kinds of networks. It grows from building blocks that are themselves rooted trees. We investigate the number of leaves, depth of nodes, total path length, and height of such trees. We use methods from the theory of Pólya urns and martingales.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 28 , Issue 1 , January 2014 , pp. 67 - 81
Copyright
Copyright © Cambridge University Press 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

Dedicated to the memory of Philippe Flajolet.

References

1.Athreya, K. & Karlin, S. (1968). Embedding of urn schemes into continuous time Markov branching processes and related limit theorems. Annals of Mathematical Statistics 39: 1801–1817.CrossRefGoogle Scholar
2.Bergeron, F., Flajolet, P., & Salvy, B. (1992). Varieties of increasing trees. In Raoult, Jean-Claude (ed.), Proceedings of the 17th Colloquium on Trees in Algebra and Programming (CAAP ’92). Lecture Notes in Computer Science. Berlin/Heidelberg: Springer, Vol. 581, pp. 24–48.Google Scholar
3.Billingsley, P. (1995). Probability and measure, 3rd edn.New York: Wiley-Interscience.Google Scholar
4.Broutin, N. & Devroye, L. (2006). Large deviations for the weighted height of an extended class of trees. Algorithmica 46(3): 271–297.Google Scholar
5.Dawid, A. P. & Evett, I. (1997). Using a graphical method to assist the evaluation of complicated patterns of evidence. Journal of Forensic Sciences 42: 401–412.Google Scholar
6.Dondajewski, M. & Szymański, J. (1982). On the distribution of vertex-degrees in a strata of a random recursive tree. Bulletin de l'Académie Polonaise des Sciences 30: 205–209.Google Scholar
7.Goulet, V. & Pouliot, L.-P. (2008). Simulation of compound hierarchical models in R. North American Actuarial Journal 12: 401–412.CrossRefGoogle Scholar
8.Joshi, A.K., Levy, L.S., & Takahashi, M. (1975). Tree adjunct grammars. Journal of Computer and System Sciences 10(1): 136–163.CrossRefGoogle Scholar
9.Mahmoud, H.M. (1991). Limiting distributions for path lengths in recursive trees. Probability in the Engineering and Informational Sciences 5: 53–59.Google Scholar
10.Matthews, P.C. & Rosenberger, W.F. (1997). Variance in randomized play-the-winner clinical trials. Statistics & Probability Letters 35(3): 233–240.CrossRefGoogle Scholar
11.Munsonius, G.O. & Rüschendorf, L. (2011). Limit theorems for depths and distances in weighted random b-ary recursive trees. Journal of Applied Probability 48(4): 1060–1080.CrossRefGoogle Scholar
12.Na, H.S. & Rapoport, A. (1970). Distribution of nodes of a tree by degree. Mathematical Biosciences 6: 313–329.Google Scholar
13.Najock, D. & Heyde, C.C. (1982). On the number of terminal vertices in certain random trees with an application to stemma construction in philology. Journal of Applied Probability 19: 675–680.Google Scholar
14.Pittel, B. (1994). Note on the heights of random recursive trees and random m-ary search trees. Random Structures and Algorithms 5: 337–347.CrossRefGoogle Scholar
15.Smythe, R.T. (1996). Central limit theorems for urn models. Stochastic Processes and their Applications 65: 115–137.Google Scholar
16.Smythe, R.T. & Mahmoud, H. (1995). A survey of recursive trees. Theory of Probability and Mathematical Statistics 51: 1–27.Google Scholar
17.Xie, C., Zhang, H., Shimkets, L.J., & Igoshin, O.A. (2011). Statistical image analysis reveals features affecting fates of myxococcus xanthus developmental aggregates. Proceedings of the National Academy of Sciences 108(14): 5915–5920.CrossRefGoogle ScholarPubMed