Ascents and descents in random trees
From MaRDI portal
Publication:3078477
DOI10.1080/09720529.2008.10698201zbMATH Open1206.05034OpenAlexW2313811987MaRDI QIDQ3078477FDOQ3078477
Authors: Lane Clark 
Publication date: 28 February 2011
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2008.10698201
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
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic bounds on the coefficients of polynomials with only real zeros
- Stirling Behavior is Asymptotically Normal
- Bijections for Cayley trees, spanning trees, and their q-analogues
- Title not available (Why is that?)
- On the Distribution of the Number of Successes in Independent Trials
- Asymptotic properties of eulerian numbers
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Local extrema in random trees
Cited In (6)
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)
