Brownian bridge asymptotics for random p-mappings

Electronic Journal of Probability

Volumn 9, Issue , 2004, Pages 37-56

  Aldous, David ^a   Miermont, Grégory ^b   Pitman, Jim ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Brownian bridge; Brownian excursion; Joyal map; Random mapping; Random tree; Weak convergence

Indexed keywords

EID: 2942569560     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v9-186     Document Type: Article

References (19)

1. D. J. Aldous and J. Pitman. Two recursive decompositions of Brownian bridge related to the asymptotics of random mappings. Technical Report 595, Dept. Statistics, U.C. Berkeley, 2002.
2. D.J. Aldous. The continuum random tree III. Ann. Probab., 21:248-289, 1993.
3. D.J. Aldous, G. Miermont, and J. Pitman. Weak convergence of random p-mappings and the exploration process of the inhomogeneous continuum random tree. In preparation, 2004.
4. D.J. Aldous and J. Pitman. Brownian bridge asymptotics for random mappings. Random Structures Algorithms, 5:487-512, 1994.
5. D.J. Aldous and J. Pitman. The asymptotic distribution of the diameter of a random mapping. C. R. Math. Acad. Sci. Paris, 334:1-4, 2002.
6. D.J. Aldous and J. Pitman. Invariance principles for non-uniform random mappings and trees. In V.A. Malyshev and A.M. Vershik, editors, Asymptotic Combinatorics with Applications to Mathematical Physics, pages 113-147. Kluwer, 2002. Available at http://www.stat.berkeley.edu/tech-reports/594.ps.Z.
7. J. Bertoin and J. Pitman. Path transformations connecting Brownian bridge, excursion and meander. Bull. Sci. Math. (2), 118:147-166, 1994.
8. P. Biane. Relations entre pont et excursion du mouvement Brownien reel. Ann. Inst. Henri Poincare, 22:1-7, 1986.
9. P. Biane. Some comments on the paper: “Brownian bridge asymptotics for random mappings” by D. J. Aldous and J. W. Pitman. Random Structures and Algorithms, 5:513-516, 1994.
10. M. Camarri and J. Pitman. Limit distributions and random trees derived from the birthday problem with unequal probabilities. Electron. J. Probab., 5:Paper 2, 1-18, 2000.
11. M. Drmota and B. Gittenberger. On the profile of random trees. Random Structures and Algorithms, 10:421-451, 1997.
12. B. Harris. A survey of the early history of the theory of random mappings. In Probabilistic methods in discrete mathematics (Petrozavodsk, 1992), pages 1-22. VSP, Utrecht, 1993.
13. A. Joyal. Une theorie combinatoire des series formelles. Adv. in Math., 42:1-82, 1981.
14. V.F. Kolchin. Random Mappings. Optimization Software, New York, 1986. (Translation of Russian original).
15. J.-F. Marckert and A. Mokkadem. The depth first processes of Galton-Watson trees converge to the same Brownian excursion. Ann. Probab., 31:1655-1678, 2003.
16. C. A. O’Cinneide and A. V. Pokrovskii. Nonuniform random transformations. Ann. Appl. Probab, 10(4):1151-1181, 2000.
17. J. Pitman. Random mappings, forests and subsets associated with Abel-Cayley-Hurwitz multinomial expansions. Séminaire Lotharingien de Combinatoire, Issue 46:45 pp., 2001. www.mat.univie.ac.at/∼slc/.
18. J. Pitman. Combinatorial Stochastic Processes. Technical Report 621, Dept. Statistics, U.C. Berkeley, 2002. Lecture notes for St. Flour course, July 2002. Available via www.stat.berkeley.edu.
19. J. Pitman and M. Yor. Arcsine laws and interval partitions derived from a stable subordinator. Proc. London Math. Soc. (3), 65:326-356, 1992.