Width of a scale-free tree

DOI10.1239/JAP/1127322031zbMATH Open1079.05090OpenAlexW2156855833MaRDI QIDQ3367752FDOQ3367752

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

Recommendations

• Levels of a scale-free tree
• The diameter of a scale-free random graph
• Branches in scale-free trees
• On random trees
• The degree distribution of thickened trees

zbMATH Keywords

random graph

Mathematics Subject Classification ID

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

Cites Work

• Emergence of Scaling in Random Networks
• Singularity Analysis of Generating Functions
• The profile of binary search trees
• The degree sequence of a scale-free random graph process
• The diameter of a scale-free random graph
• Note on the heights of random recursive trees and random m‐ary search trees
• Title not available (Why is that?)
• On random trees

Cited In (11)

• The height of increasing trees
• Random walks with preferential relocations and fading memory: a study through random recursive trees
• Geometry of weighted recursive and affine preferential attachment trees
• Voronoi cells in random split trees
• Edgeworth expansions for profiles of lattice branching random walks
• Analysis of attachment models for directory and file trees
• Phase Changes in the Topological Indices of Scale-Free Trees
• On martingale tail sums for the path length in random trees
• Large deviations for the degree structure in preferential attachment schemes
• General Edgeworth expansions with applications to profiles of random trees
• Levels of a scale-free tree

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)