Ascents and descents in random trees

DOI10.1080/09720529.2008.10698201zbMath1206.05034OpenAlexW2313811987MaRDI QIDQ3078477

Lane H. 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

zbMATH Keywords

treecentral limit theoremdescentAscentlocal limit theorem.

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15)

Related Items (2)

A statistic related to trees and words on a finite alphabet ⋮ Runs in labelled trees and mappings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Central and local limit theorems for the coefficients of polynomials of binomial type
• Probabilistic bounds on the coefficients of polynomials with only real zeros
• Local extrema in random trees
• Stirling Behavior is Asymptotically Normal
• On the Distribution of the Number of Successes in Independent Trials
• Asymptotic properties of eulerian numbers

This page was built for publication: Ascents and descents in random trees