Name
Title | ||
|---|---|---|
Link community detection through global optimization and the inverse resolution limit of partition density. |
Abstract | ||
|---|---|---|
Finding overlapping communities of complex networks remains a challenge in network science. To address this challenge, one of the widely used approaches is finding the communities of links by optimizing the objective function, partition density. In this study, we show that partition density suffers from inverse resolution limit; it has a strong preference to triangles. This resolution limit makes partition density an improper objective function for global optimization. The conditions where partition density prefers triangles to larger link community structures are analytically derived and confirmed with global optimization calculations using synthetic and real-world networks. To overcome this limitation of partition density, we suggest an alternative measure, Link Surprise, to find link communities, which is suitable for global optimization. Benchmark studies demonstrate that global optimization of Link Surprise yields meaningful and more accurate link community structures than partition density optimization. |
Year | Venue | Field |
|---|---|---|
2016 | Scientific Reports | Network science,Mathematical optimization,Global optimization,Complex network,Surprise,Partition (number theory),Mathematics,Inverse resolution |
DocType | Volume | Citations |
Journal | abs/1601.05100 | 0 |
PageRank | References | Authors |
0.34 | 12 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juyong Lee | 1 | 35 | 3.50 |
| Zhong-Yuan Zhang | 2 | 14 | 2.95 |
| Jooyoung Lee | 3 | 573 | 46.13 |
| Bernard R. Brooks | 4 | 586 | 81.32 |
| Yong-Yeol Ahn | 5 | 2124 | 138.24 |