Width of a scale-free tree
From MaRDI portal
Recommendations
Cites work
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 1409903 (Why is no real title available?)
- Note on the heights of random recursive trees and random m‐ary search trees
- On random trees
- Singularity Analysis of Generating Functions
- The degree sequence of a scale-free random graph process
- The diameter of a scale-free random graph
- The profile of binary search trees
Cited in
(16)- Edgeworth expansions for profiles of lattice branching random walks
- General Edgeworth expansions with applications to profiles of random trees
- Large deviations for the degree structure in preferential attachment schemes
- Geometry of weighted recursive and affine preferential attachment trees
- The degree distribution of thickened trees
- Levels of a scale-free tree
- Random walks with preferential relocations and fading memory: a study through random recursive trees
- Phase changes in the topological indices of scale-free trees
- On martingale tail sums for the path length in random trees
- The height of increasing trees
- Voronoi cells in random split trees
- A random recursive tree model with doubling events
- Structural results for the tree builder random walk
- Leaves of preferential attachment trees
- Analysis of attachment models for directory and file trees
- A complementary view on the growth of directory trees
This page was built for publication: Width of a scale-free tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3367752)
