Limit laws for embedded trees: Applications to the integrated superBrownian excursion
- 18 September 2006
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 29 (4) , 475-523
Abstract
No abstract availableKeywords
All Related Versions
This publication has 27 references indexed in Scilit:
- The rotation correspondence is asymptotically a dilatationRandom Structures & Algorithms, 2004
- Random planar lattices and integrated superBrownian excursionProbability Theory and Related Fields, 2003
- Left ternary trees and non-separable rooted planar mapsTheoretical Computer Science, 2000
- A Bijective Census of Nonseparable Planar MapsJournal of Combinatorial Theory, Series A, 1998
- On the profile of random treesRandom Structures & Algorithms, 1997
- Mellin transforms and asymptotics: Harmonic sumsTheoretical Computer Science, 1995
- Tree-based models for random distribution of massJournal of Statistical Physics, 1993
- Some properties for the measure-valued branching diffusion processesJournal of the Mathematical Society of Japan, 1989
- Planar Maps are Well Labeled TreesCanadian Journal of Mathematics, 1981
- A Census of Planar MapsCanadian Journal of Mathematics, 1963