On edge-weighted recursive trees and inversions in random permutations
From MaRDI portal
Publication:2467733
Recommendations
- ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES
- Deterministic edge weights in increasing tree families
- Limiting distributions for the number of inversions in labelled tree families
- Limit theorems for depths and distances in weighted random b-ary recursive trees
- Inversions in split trees and conditional Galton-Watson trees
Cites work
- A Note on the Theory of Moment Generating Functions
- Asymptotic degree distribution in random recursive trees
- Central and local limit theorems applied to asymptotic enumeration
- Cutting down recursive trees
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3620754 (Why is no real title available?)
- scientific article; zbMATH DE number 1245629 (Why is no real title available?)
- scientific article; zbMATH DE number 1540682 (Why is no real title available?)
- scientific article; zbMATH DE number 1409903 (Why is no real title available?)
- Level of nodes in increasing trees revisited
- On the degree distribution of the nodes in increasing trees
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- Quickselect and the Dickman Function
- The fundamental limit theorems in probability
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
Cited in
(5)
This page was built for publication: On edge-weighted recursive trees and inversions in random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467733)