Width of a scale-free tree
From MaRDI portal
Publication:3367752
DOI10.1239/jap/1127322031zbMath1079.05090MaRDI QIDQ3367752
Publication date: 26 January 2006
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1127322031
Related Items
Random walks with preferential relocations and fading memory: a study through random recursive trees, Phase Changes in the Topological Indices of Scale-Free Trees, The height of increasing trees, On martingale tail sums for the path length in random trees, 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
Cites Work
- Unnamed Item
- The profile of binary search trees
- The diameter of a scale-free random graph
- The degree sequence of a scale-free random graph process
- Emergence of Scaling in Random Networks
- Singularity Analysis of Generating Functions
- Note on the heights of random recursive trees and random m‐ary search trees
- On random trees