---恢复内容开始---
本文介绍Lancichinetti, Andrea, 和 Santo Fortunato 在论文中发表的FLR方法生产大型复杂网络。
references:
Lancichinetti, Andrea, and Santo Fortunato. "Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities." Physical Review E 80.1 (2009): 016118.
原理:
(待补充)
源代码:
language: C++
模拟运行环境: Ubuntu 12.04 4GB 4核处理器 20G hard disk
产生实验数据:
N节点网络, 平均度数为15,最大度数为50,混合参数为0.2 最小社区规模为 20,最大社区规模50,重叠社区节点个数 20%, 重叠节点所属4个社区。
实验中,N 取值为 1000,2000,5000,10000,20000,50000,100000,200000,500000,1000000
十组数据。
1. network.dat
contains the list of edges (nodes are labelled from 1 to the number of nodes; the edges are ordered and repeated twice, i.e. source-target and target-source).
2. community.dat
community.dat contains a list of the nodes and their membership (memberships are labelled by integer numbers >=1).
3. statistic.dat
statistics.dat contains the degree distribution (in logarithmic bins), the community size distribution, and the distribution of the mixing parameter.
reference by souce code:readme.txt by Lancichinetti