Deterministic edge weights in increasing tree families
From MaRDI portal
Publication:3557527
Recommendations
- ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES
- On the degree distribution of the nodes in increasing trees
- On the distribution of distances between specified nodes in increasing trees
- On edge-weighted recursive trees and inversions in random permutations
- Limit theorems for functionals of recursive trees.
Cites work
- A central limit theorem for decomposable random variables with applications to random graphs
- Asymptotic degree distribution in random recursive trees
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- Level of nodes in increasing trees revisited
- Multiple comparisons and sums of dissociated random variables
- On convergence rates in the central limit theorems for combinatorial structures
- On edge-weighted recursive trees and inversions in random permutations
- Poisson approximations for functionals of random trees
Cited in
(4)
This page was built for publication: Deterministic edge weights in increasing tree families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557527)