Advertisement

Ideals in a Forest, One-Way Infinite Binary Trees and the Contraction Method

  • Svante Janson
Conference paper
Part of the Trends in Mathematics book series (TM)

Abstract

The analysis of an algorithm by Koda and Ruskey for listing ideals in a forest poset leads to a study of random binary trees and their limits as infinite random binary trees. The corresponding finite and infinite random forests are studied too. The infinite random binary trees and forests studied here have exactly one infinite path; they can be defined using suitable size-biazed GaltonWatson processs. Limit theorems are proved using a version of the contraction method.

Keywords

Binary Tree Binary Search Tree Fixed Point Equation Infinite Path Contraction Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Aldous (1991) The continuum random tree II: an overview. In Proc. Durham Symp. Stoch. Analysis 1990, Cambridge Univ. Press, 23–70.CrossRefGoogle Scholar
  2. [2]
    D. Aldous (1993) The continuum random tree III. Ann. Probab. 21, no. 1, 248–289.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    K.B. Athreya & P.E. Ney (1972) Branching Processes. Springer-Verlag, Berlin,1972.zbMATHCrossRefGoogle Scholar
  4. [4]
    P. Billingsley (1968) Convergence of Probability Measures. Wiley, New York.zbMATHGoogle Scholar
  5. [5]
    T.E. Harris (1951) Some mathematical models for branching processes. In Second Berkeley Symposium on Mathematical Statistics and Probability, Univ. California Press, Berkeley, 305–328.Google Scholar
  6. [6]
    R.L. Graham, D.E. Knuth & O. Patashnik (1994) Concrete Mathematics. 2nd ed., Addison-Wesley, Reading, Mass.Google Scholar
  7. [7]
    D.P. Kennedy (1975) The Galton-Watson process conditioned on the total progeny. J. Appl. Probab. 12, 800–806.Google Scholar
  8. [8]
    M. Klazar (1997) Twelve countings with rooted plane trees. European J. Combin. 18, no. 2, 195–210. Addendum: European J. Combin. 18, no. 6, 739–740.Google Scholar
  9. [9]
    D.E. Knuth (1997) The Art of Computer Programming. Vol. 1: Fundamental algorithms. 3rd ed., Addison-Wesley, Reading, Mass.zbMATHGoogle Scholar
  10. [10]
    D.E.Knuth, KODA-RUSKEY. CWEB program. Available from http://Sunburn.Stanford.EDU/~knuth/programs/koda-ruskey.w/~knuth/programs/koda-ruskey.w
  11. [11]
    Y. Koda & F. Ruskey (1993), A Gray code for the ideals of a forest poset. J. Algorithms 15, no. 2, 324–340.Google Scholar
  12. [12]
    J.-F. Le Gall (1986) Une approche élémentaire des théorèmes de décomposition de Williams. In Séminaire de Probabilités, XX, 1984/85, Lecture Notes in Math., 1204,Springer, Berlin, 447–464.Google Scholar
  13. [13]
    R. Lyons, R. Pemantle & Y. Peres (1995) Conceptual proofs of L log L criteria for mean behavior of branching processes. Ann. Probab. 23, no. 3, 1125–1138.Google Scholar
  14. [14]
    J.-F. Marckert & A. Mokkadem (2001) The depth first processes of Galton-Watson trees converge to the same Brownian excursion. To appear in Ann. Probab.Google Scholar
  15. [15]
    S.T. Rachev (1991) Probability metrics and the stability of stochastic models. Wiley, Chichester, U.K.Google Scholar
  16. [16]
    S.T. Rachev & L. Rüschendorf (1995) Probability metrics and recursive algorithms Adv. Appl. Probab. 27, 770–799.zbMATHCrossRefGoogle Scholar
  17. [17]
    U. Rösler (1991), A limit theorem for “Quicksort”. RAIRO Inform. Théor. Appl. 25, no. 1,85–100.MathSciNetzbMATHGoogle Scholar
  18. [18]
    U. Rösler (1992), A fixed point theorem for distributions. Stochastic Process. Appl. 42, no. 2, 195–214.MathSciNetzbMATHGoogle Scholar
  19. [19]
    U. Rösler & L. Rüschendorf (2001) The contraction method for recursive algorithms. Algorithmica 29, 3–33.MathSciNetzbMATHCrossRefGoogle Scholar
  20. [20]
    F. Ruskey (1981) Listing and counting subtrees of a tree. SIAM J. Comput. 10, no. 1, 141–150.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Basel AG 2002

Authors and Affiliations

  • Svante Janson
    • 1
  1. 1.Department of MathematicsUppsala UniversityUppsalaSweden

Personalised recommendations