Phase Transition for Parking Blocks, Brownian Excursion and Coalescence

Random Structures and Algorithms

Volumn 21, Issue 1, 2002, Pages 76-119

  Chassaing, P ^a   Louchard, G ^b  

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

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Brownian excursion; Coalescence; Empirical processes; Hashing with linear probing; Parking

Indexed keywords

EID: 0036335474     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10039     Document Type: Article

References (54)

1. D. J. Aldous, Exchangeability and related topics. École d'ét́é de probabilités de Saint-Flour XIII-1983, Lecture Notes in Mathematics, 1117, Springer-Verlag, New York, 1985, pp. 1-198.
2. D. Aldous, Hashing with linear probing, under non-uniform probabilities, Probab Eng Inform Sci 2 (1988), 1-14.
3. D. Aldous, The continuum random tree III, Ann Probab 21 (1993), 248-289.
4. D. J. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann Probab 25 (1997), 812-854.
5. D. Aldous, Stochastic coalescence, Documenta Math, Extra Volume I.C.M. 1998, III (1998), 205-211.
6. D. Aldous, Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists, Bernoulli 5(1) (1999), 3-48.
7. D. J. Aldous and J. Pitman, Brownian bridge asymptotics for random mappings, Random Struct Alg 5(4) (1994), 487-512.
8. D. J. Aldous and J. Pitman. The standard additive coalescent, Ann Probab 26 (1998), 1703-1726.
9. N. Alon and J. H. Spencer, The probabilistic method, with an appendix by Paul Erdös, Wiley, New York, 1992.
10. R. Arratia, A. D. Barbour, and S. Tavaré, Poisson process approximations for the Ewens sampling formula, Ann Appl Probab 2(3) (1992), 519-535.
11. R. Arratia, A. D. Barbour, and S. Tavaré, On Poisson-Dirichlet limits for random decomposable combinatorial structures, Combinat Probab Comput 8(3) (1999), 193-208.
12. J. Bertoin, A fragmentation process connected to Brownian motion, Probab Theory Relat Fields 117 (2000), 289-301.
13. P. Billingsley, Convergence of probability measures, Wiley, New York, 1968.
14. B. Bollobás, Random graphs, Academic, New York, 1985.
15. P. Chassaing and J. F. Marckert, Parking functions, empirical processes and the width of rooted labeled trees, Electron J Combinat 8(1) (2001), R14.
16. P. Chassaing and S. Janson, A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0, Ann Probab 29 (2001), 1755-1779.
17. P. Chassaing and G. Louchard, Phase transition for parking blocks, Brownian excursion and coalescence, Prépublication 99/34 de l'Institut Elie Cartan, September, Nancy, France, 1999, http://www.iecn.u-nancy.fr/̃chassain.
18. M. Csörgö and P. Révész, Strong approximations in probability and statistics, Probability and Mathematical Statistics, Academic, New York, 1981.
19. K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Ark Mat Astron Fys 22 (1930), 1-14.
20. M. D. Donsker, Justification and extension of Doob's heuristic approach to the Kolmogorov-Smirnov theorems, Ann Math Stat 23 (1952), 277-281.
21. S. N. Evans and J. Pitman, Construction of Markovian coalescents, Ann Inst H Poincaré 34(3) (1998), 339-383.
22. P. Flajolet, D. E. Knuth, and B. Pittel, The first cycles in an evolving graph, Graph theory and combinatorics (Cambridge, 1988), Discrete Math 75(1-3) (1989), 167-215.
23. P. Flajolet, P. Poblete, and A. Viola, On the analysis of linear probing hashing, Algoritmica 22(4) (1998), 490-515.
24. Ph. Flajolet and B. Salvy, 2001, private communication.
25. D. Foata and J. Riordan, Mappings of acyclic and parking functions, Aeq Math 10 (1974), 10-22.
26. J. Françon, Acyclic and parking functions, J Combinat Theory Ser A 18 (1975), 27-35.
27. J. M. Harrison, Brownian motion and stochastic flow systems, Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, Wiley, New York, 1985.
28. S. Janson, D. E. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Random Struct Alg 4(3) (1993), 231-358.
29. D. E. Knuth, The art of computer programming. Vol. 3: Sorting and Searching, 2nd ed., Addison-Wesley, Reading, MA, 1997.
30. D. E. Knuth, Linear probing and graphs, Algorithmica 22(4) (1998), 561-568.
31. A. G. Konheim and B. Weiss, An occupancy discipline and applications, SIAM J Appl Math 14(6) (1966), 1266-1274.
32. G. Louchard, Large finite population queuing systems: The finite server model, Stoch Proc Appl 55 (1994), 117-145.
33. P. Massart, The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality, Ann Probab 18(3) (1990), 1269-1283.
34. Yu. L. Pavlov, The asymptotic distribution of maximum tree size in a random forest, Theor Probab Appl 22 (1977), 509-520.
35. M. Perman, Order statistics for jumps of normalized subordinators, Stoch Process Appl 46(2) (1993), 267-281.
36. M. Perman, J. Pitman, and M. Yor, Size-biased sampling of Poisson point processes and excursions, Probab Theory Relat Fields 92(1) (1992), 21-39.
37. J. Pitman, Exchangeable and partially exchangeable random partitions, Probab Theory Relat Fields 102(2) (1995), 145-158.
38. J. Pitman, Random discrete distributions invariant under size-biased permutation, Adv Appl Probab 28(2) (1996), 525-539.
39. J. Pitman and R. Stanley, A polytope related to empirical distributions, plane trees, working functions, and the associahedron, Technical Report 560, Department of Statistics, University of California, Berkeley, June 1999, Disc and Comp Geom 27 (2002), 603-634.
40. J. Pitman and M. Yor, Arcsine laws and interval partitions derived from a stable subordinator, Proc Lond Math Soc (3) 65(2) (1992), 326-356.
41. J. Pitman and M. Yor, The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator, Ann Probab 25(2) (1997), 855-900.
42. B. Pittel, Linear probing: The probable largest search time grows logarithmically with the number of records, J Alg 8(2) (1987), 236-249.
43. D. Pollard, Convergence of stochastic processes, Springer Series in Statistics, Springer-Verlag, New York, 1984.
44. D. Revuz and M. Yor, Continuous martingales and Brownian motion, 2nd edition, p 23, Section 3, Springer-Verlag, New York, 1994.
45. J. Riordan, Ballots and trees, J Combinat Theory 6 (1969), 408-411.
46. L. C. G. Rogers and D. Williams, Diffusions, Markov processes, and martingales. Vol. 1. Foundations, 2nd edition, Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, Wiley, Chichester, 1994.
47. L. A. Shepp and S. P. Lloyd, Ordered cycle lengths in a random permutation, Trans Am Math Soc 121 (1966), 340-357.
48. G. R. Shorack and J. A. Wellner, Empirical processes with applications to statistics, Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, Wiley, New York, 1986.
49. M. P. Schutzenberger, On an enumeration problem, J Combinat Theory 4 (1968), 219-221.
50. R. Stanley, Parking functions and noncrossing partitions, Electron J Combinat 4(2) (1997) R20.
51. R. Stanley, "Hyperplane arrangements, parking functions, and tree inversions," Mathematical Essays in Honor of Gian-Carlo Rota, B. Sagan and R. Stanley (Editors), Birkhäuser, Boston, 1998, pp. 259-375.
52. G. Tenenbaum, Introduction à la théorie analytique et probabiliste des nombres, 2nd edition, Cours Spécialisés, Société Mathématique de France, Paris, 1995.
53. W. Vervaat, A relation between Brownian bridge and Brownian excursion, Ann Probab 7(1) (1979), 143-149.
54. M. Yor, Local times and excursions for Brownian motion: A concise introduction, Lecciones en Matemáticas, Universidad Central de Venezuela, 1995.