Ascents and descents in random trees
From MaRDI portal
Publication:3078477
Recommendations
- On the number of descendants and ascendants in random search trees
- The climbing depth of random trees
- On random trees
- Asymptotic degree distribution in random recursive trees
- scientific article; zbMATH DE number 1380601
- Random Trees in Random Graphs
- Random trees and applications
- Random trees and general branching processes
- Random walks and trees
Cites work
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Asymptotic properties of eulerian numbers
- Bijections for Cayley trees, spanning trees, and their q-analogues
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Local extrema in random trees
- On the Distribution of the Number of Successes in Independent Trials
- Probabilistic bounds on the coefficients of polynomials with only real zeros
- Stirling Behavior is Asymptotically Normal
Cited in
(6)- scientific article; zbMATH DE number 1552326 (Why is no real title available?)
- Local extrema in random trees
- A statistic related to trees and words on a finite alphabet
- Runs in labelled trees and mappings
- Tree descent polynomials: unimodality and central limit theorem
- An insertion algorithm and leaders of rooted trees
This page was built for publication: Ascents and descents in random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078477)