The rotation correspondence is asymptotically a dilatation

DOI10.1002/rsa.10111zbMath1034.05016OpenAlexW2031923301MaRDI QIDQ4459585

Jean-François Marckert

Publication date: 29 March 2004

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10111

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (11)

XML compression via directed acyclic graphs ⋮ The density of the ISE and local limit laws for embedded trees ⋮ The left-right-imbalance of binary search trees ⋮ Occupation densities of ensembles of branching random walks ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ On the Joint Path Length Distribution in Random Binary Trees ⋮ Left and right length of paths in binary trees or on a question of Knuth ⋮ Precise logarithmic asymptotics for the right tails of some limit random variables for random trees ⋮ The lineage process in Galton-Watson trees and globally centered discrete snakes ⋮ Branching random walks on binary search trees: convergence of the occupation measure ⋮ Imbalance in random digital trees

Cites Work

• Random planar lattices and integrated superBrownian excursion
• Weak convergence and empirical processes. With applications to statistics

This page was built for publication: The rotation correspondence is asymptotically a dilatation