arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.6802physics.soc-phcs.SI
收藏

大规模带圈随机图的生成算法

Algorithms for Generating Large-scale Clustered Random Graphs

Cheng Wang

摘要:

真实的社交网络经常与随机图进行比较,以评估其类型结构是否可能是随机过程的结果。然而,大规模的Erdens-Rényi随机图往往缺乏二进层以外的局部结构,因此需要生成聚类随机图来比较三进层的局部结构,而不是简单随机图.本文提出了一种广义的Gleeson算法,用于生成大规模的随机聚类图,该随机聚类图的节点数|V|、边数|E|和全局聚类系数CΔ与实际网络一样。与现有算法相比,该算法在随机性评价和计算时间上也具有优势。

英文摘要:

Real social networks are often compared to random graphs in order to assess whether their typological structure could be the result of random processes. However, an Erdős-Rényi random graph in large scale is often lack of local structure beyond the dyadic level and as a result we need to generate the clustered random graph instead of the simple random graph to compare the local structure at the triadic level. In this paper a generalized version of Gleeson's algorithm is advanced to generate a clustered random graph in large-scale which persists the number of nodes |V|, the number of edges |E|, and the global clustering coefficient CΔ as in the real network. And it also has advantages in randomness evaluation and computation time when comparing with the existing algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑