Scale free properties of random \(k\)-trees

DOI10.1007/S11786-010-0041-6zbMath1205.05211OpenAlexW2017815051MaRDI QIDQ626908

Ryuhei Uehara, Colin Cooper

Publication date: 19 February 2011

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

Full work available at URL: https://doi.org/10.1007/s11786-010-0041-6

zbMATH Keywords

\(k\)-treeclustering coefficientsmall world networkapollonian networkscale free graph

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Internet topics (68M11)

Related Items (5)

Competitive Diffusion on Weighted Graphs ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Randomized rumor spreading in poorly connected small-world networks ⋮ Some Properties of Random Apollonian Networks ⋮ The height of random k‐trees and related branching processes

Cites Work

• A polynomial of graphs on surfaces
• A partial k-arboretum of graphs with bounded treewidth
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Emergence of Scaling in Random Networks
• Scale Free Interval Graphs
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scale free properties of random \(k\)-trees