Width of a scale-free tree

DOI10.1239/jap/1127322031zbMath1079.05090OpenAlexW2156855833MaRDI QIDQ3367752

Zsolt Katona

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

zbMATH Keywords

random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (8)

Phase Changes in the Topological Indices of Scale-Free Trees ⋮ Edgeworth expansions for profiles of lattice branching random walks ⋮ Large deviations for the degree structure in preferential attachment schemes ⋮ General Edgeworth expansions with applications to profiles of random trees ⋮ Random walks with preferential relocations and fading memory: a study through random recursive trees ⋮ The height of increasing trees ⋮ On martingale tail sums for the path length in random trees ⋮ 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

This page was built for publication: Width of a scale-free tree