The asymptotic contour process of a binary tree is a Brownian excursion
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3847416 (Why is no real title available?)
- scientific article; zbMATH DE number 3947370 (Why is no real title available?)
- scientific article; zbMATH DE number 4023312 (Why is no real title available?)
- scientific article; zbMATH DE number 4041254 (Why is no real title available?)
- scientific article; zbMATH DE number 3761421 (Why is no real title available?)
- scientific article; zbMATH DE number 30754 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3624495 (Why is no real title available?)
- scientific article; zbMATH DE number 3206627 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A relation between Brownian bridge and Brownian excursion
- On Level Numbers of t-Ary Trees
- On the Average Shape of Binary Trees
- On the average oscillation of a stack
- On the average shape of simply generated families of trees
- One-dimensional Brownian motion and the three-dimensional Bessel process
- The asymptotic distribution of leaf heights in binary trees
- The average height of binary trees and other simple trees
- The limiting common distribution of two leaf heights in a random binary tree
Cited in
(4)
This page was built for publication: The asymptotic contour process of a binary tree is a Brownian excursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198554)