On the distribution of betweenness centrality in random trees

DOI10.1016/j.tcs.2016.12.023zbMath1380.05178OpenAlexW2566129984MaRDI QIDQ1675928

Peng Zhang

Publication date: 3 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.023

zbMATH Keywords

centroidrandom treeincreasing treebetweenness centralitysimply generated treesubcritical graph class

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The continuum random tree. I
• Recursive self-similarity for random trees, random triangulations and Brownian excursion
• On centroid branches of trees from certain families
• The continuum random tree. III
• Limit Theorems for Subtree Size Profiles of Increasing Trees
• Asymptotic Study of Subcritical Graph Classes
• Random Trees
• On the Altitude of Nodes in Random Trees
• Community structure in social and biological networks
• On Major and Minor Branches of Rooted Trees
• Level of nodes in increasing trees revisited
• Classification of scale-free networks
• Networks

This page was built for publication: On the distribution of betweenness centrality in random trees