.png){kind=icon}
返回
Clustering in random line graphs
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2009.09.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate the degree distribution P(k) and the clustering coefficient C of the line graphs constructed on the Erdos-Renyi networks, the exponential and the scale-free growing networks. We show that the character of the degree distribution in these graphs remains Poissonian, exponential and power law, respectively, i.e. the same as in the original networks. When the mean degree (k) increases, the obtained clustering coefficient C tends to 0.50 for the transformed Erdos-Renyi networks, to 0.53 for the transformed exponential networks and to 0.61 for the transformed scale-free networks. These results are close to theoretical values, obtained with the model assumption that the degree-degree correlations in the initial networks are negligible. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Line graphs
Random networks
Clustering coefficient
Degree distribution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
引用论文
分享收藏Tandem SAM Domain Structure of Human Caskin1: A Presynaptic, Self-Assembling Scaffold for CASK.png)
StructureOAAI
StructureIF0
OAAI分享收藏
查看更多内容