Parking functions, empirical processes, and the width of rooted labeled trees

Electronic Journal of Combinatorics

Volumn 8, Issue 1 R, 2001, Pages 1-19

  Chassaing, Philippe ^a   Marckert, Jean François ^b  

^a UNIVERSITÉ HENRI POINCARÉ NANCY 1   (France)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

Brownian excursion; Empirical processes; Hashing with linear probing; Moment; Parking; Rooted labeled trees; Width

Indexed keywords

EID: 0007508829     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1558     Document Type: Article

References (29)

1. D. Aldous, (1991) The continuum random tree II: an overview. Stochastic analysis, Proc. Symp., Durham/UK 1990, Lond. Math. Soc. Lect. Note Ser. 167, 23-70.
2. D. Aldous, (1993) The continuum random tree III. Ann. of Probab. 21, No.1, 248-289.
3. D. J. Aldous, (1997) Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25, No.2, 812-854.
4. D. J. Aldous, (1999) Deterministic and stochastic models for coalescence (aggregation, coagulation): a review of the mean-field theory for probabilists. Bernoulli 5, 3-48.
5. P. Biane, M. Yor, (1987) Valeurs principales associées aux temps locaux browniens. Bull. Sci. Maths 111, 23-101.
6. A. Cayley, (1889) A theorem on trees. Quarterly Journal of Pure and Applied Math. 23, 376-378.
7. Ph. Chassaing, G. Louchard, (2000) Phase transition for parking blocks, Brownian excursion and coalescence. Available at: http://www.iecn.u-nancy.fr/ ~chassain.
8. K.L. Chung, (1976) Excursions in Brownian motion. Ark. för Math., 14, p.155-177.
9. M. Drmota & B. Gittenberger, (1997) On the profile of random trees. Random Structures Algorithms 10, No. 4, 421-451.
10. M. Drmota & B. Gittenberger, (2001) The width of Galton-Watson trees. Available at: http://www.geometrie.tuwien.ac.at/drmota/
11. I.A. Ibragimov, Yu.V. Linnik, (1971) Independent and stationary sequences of random variables. Groningen, The Netherlands: Wolters-Noordhoff Publishing Company.
12. P. Flajolet, A. Odlyzko, (1982) The average height of binary trees and other simple trees. J. Comp. and Sys. Sci., 25, No.2, pages??.
13. P. Flajolet, P. Poblete, A. Viola, (1998) On the analysis of linear probing hashing. Algoritmica 22, No. 4, 490-515.
14. D. Foata, J. Riordan, (1974) Mappings of acyclic and parking functions. Aequationes math. 10, 10-22.
15. D.P. Kennedy, (1976) The distribution of the maximum Brownian excursion. J. Appl. Probab. 13, 371-376.
16. D. E. Knuth, (1997) The art of computer programming. Vol. 1: fundamental algorithms. 2nd ed., Addison-Wesley.
17. D. E. Knuth, (1998) Linear probing and graphs. Algoritmica 22, No. 4, 561-568.
18. J. Komlós, P. Major, G. Tusnády, (1975) An approximation of partial sums of independent RV's and the sample DF. I. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 32, 111-131.
19. P. Massart, (1990) The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. Ann. Probab. 18, No.3, 1269-1283.
20. J.W. Moon, (1970) Counting labelled trees. Canadian Mathematical Monographs, No. 1, Canadian Mathematical Congress, Montreal.
21. A.M. Odlyzko, H.S. Wilf, (1987) Bandwidths and profiles of trees. J. Comb. Theory, Ser. B 42, 348-370.
22. V.V. Petrov, (1975) Sums of independant random variables. Springer.
23. J. Pitman, (1998) Enumerations of trees and forests related to branching processes and random walks. In Microsurveys in Discrete Probability, ed. by D. Aldous and J. Propp. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 41, Amer. Math. Soc., Providence, RI.
24. A. Rényi & G. Szekeres, (1967) On the height of trees. J. Aust. Math. Soc. 7, 497-507.
25. M. P. Schützenberger, (1968) On an enumeration problem. J. Combinatorial Theory 4, 219-221.
26. G. R. Shorack, J. A. Wellner, (1986) Empirical processes with applications to statistics. Wiley.
27. J. Spencer, (1997) Enumerating graphs and Brownian motion. Commun. Pure Appl. Math. 50, No. 3, 291-294.
28. L. Takács, (1993) Limit distributions for queues and random rooted trees. J. Appl. Math. Stoch. Ana., 6, No.3, 189-216.
29. W. Vervaat, (1979) A relation between Brownian bridge and Brownian excursion. Ann. Probab. 7, No. 1, 143-149.