On Reshaping of Clustering Coefficients in Degree-Based Topology Generators

ALGORITHMS AND MODELS FOR THE WEB-GRAPHS, PROCEEDINGS(2009)

引用 7|浏览24
暂无评分
摘要
Recent work has shown that the Internet exhibits a power-law node degree distribution and high clustering. Considering that many existing degree-based Internet topology generators do not achieve this level of clustering, we propose a randomized algorithm that increases the clustering coefficients of graphs produced by these generators. Simulation results confirm that our algorithm makes the graphs produced by existing generators match clustering properties of the Internet topology.
更多
查看译文
关键词
power law,internet topology,randomized algorithm,clustering coefficient,degree distribution
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要