计算机科学 ›› 2011, Vol. 38 ›› Issue (11): 213-215.

• 人工智能 • 上一篇    下一篇

通用计算网络图聚类系数和环方法

程婷婷,王恒山,刘建国   

  1. (上海理工大学管理学院 上海200093)
  • 出版日期:2018-12-01 发布日期:2018-12-01

Common Algorithm on Computing Networks' Clustering Coefficient and Cycles

  • Online:2018-12-01 Published:2018-12-01

摘要: 二分图中不存在三角形,由标准聚类系数概念扩展二分图聚类系数将其定义为四边形所占比例,提出计算聚类系数的通用公式,并证明这两个聚类系数具有同样的聚类特征。把这两个聚类系数应用于计算大尺度环数目,得到适合于一分网络或是多分网络的通用计算大环数目公式。

关键词: 聚类系数,环,网络图

Abstract: Triangles arc absent in bipartite networks, this paper proposed clustering coefficient definition in bipartite networks which is the fraction of quadrilaterals. Numerical results show that both coefficients have the same property.Furthermore this paper applied both coefficients to compute the number of large cycles,deduced an common expression for estimating number of large size cycles.

Key words: Clustering coefficient, Cycles, Network graph

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!