On edge-weighted recursive trees and inversions in random permutations
From MaRDI portal
Publication:2467733
DOI10.1016/j.disc.2007.03.032zbMath1130.05019MaRDI QIDQ2467733
Publication date: 28 January 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.032
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the degree distribution of the nodes in increasing trees
- Cutting down recursive trees
- Central and local limit theorems applied to asymptotic enumeration
- Quickselect and the Dickman Function
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- Asymptotic degree distribution in random recursive trees
- Level of nodes in increasing trees revisited
- The fundamental limit theorems in probability
- A Note on the Theory of Moment Generating Functions