[1] |
Albert R,Barabasi A L.Statistical mechanics of complex networks[D].South Bend,Indiana:University of Notre Dame,2002.
|
[2] |
Newman M E J.The structure and function of complex networks[J].SIAM Review,2003,45(2):167256.
|
[3] |
Watts D J,Strogatz S H.Collective dynamics of small world networks[J].Nature,1998,393(6684):440442.
|
[4] |
Milgram S.The small world problem[J].Psychology Today,1967,32(2):185195.
|
[5] |
Barabasi A L,Albert R.Emergence of scaling in random networks[J].Science,1999,286(5439):509512.
|
[6] |
Barabasi A L,Albert R,Jeong H.Meanfield theory for scalefree random networks[J].Physica A,1999,272(12):173187.
|
[7] |
Girvan M,Newman M E J.Community structure in social and biological networks[J].Proc of the National Academy of Sciences of the USA,2002,99(12):78217826.
|
[8] |
Fortunato S.Community detection in graphs[J].Physics Reports,2010,486(35):75174.
|
[9] |
Newman M E J. Fast algorithm for detecting community structure in networks[J].Physical Review E,2004,69(06133):15.
|
[10] |
Xie J,Kelley S,Szymanski B K.Overlapping community detection in networks:The state of the art and comparative study[C]∥Proc of ACM Computing Surveys,2012:115123.
|
[11] |
Palla G,Derenyi I,Farkas I,et al.Uncovering the overlapping community structure of complex networks in nature and society[J].Nature,2005,435(7043):814818.
|
[12] |
Gregory S. An algorithm to find overlapping community structure in networks[C]∥Proc of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases,2007:91102.
|
[13] |
Gregory S.Finding overlapping communities in networks by label propagation[J].New Journal of Physics,2010,12(10):20112024.
|
[14] |
Zhang Junli, Chang Yanli, Shi Wen. Overview on label propagation algorithm and applications[J].Application Research of Computers,2013,30(1):2125.(in Chinese)
|
[15] |
Liu Dayou,Jin Di,He Dongxiao,et al.Community mining in complex networks[J].Journal of Computer Research and Development,2013,50(10):21402154.(in Chinese)
|
[16] |
Li Zhiying, Yang Wu, Xie Zhijun. Research on PageRank algorithm[J].Computer Science,2011,38(10A):185188.(in Chinese)
|
[17] |
Freeman L C.A set of measures of centrality based on betweenness[J].Sociometry,1977,40(1):3541.
|
[18] |
Freeman L C.Centrality in social networks:ii.Experimental Results[J].Social Networks,1979,1(2):119141.
|
[19] |
Freeman L C.Centrality in social networks:Conceptual clarification[J].Social Networks,1979,1(3):215239.
|
[20] |
Brandes U.A faster algorithm for betweenness centrality[J]. Journal of Mathematical Sociology,2001,25(2):163177.
|
[21] |
Newman M E J.A measure of betweeness centrality based on random walks[J].Social Networks,2005,27(1):3954.
|
[22] |
Estrada E,RodriguezVelazquez J A.Subgraph centrality in complex networks[J].Phys Rev E Stat Nonlin Soft Matter Phys,2005,71(5):122133.
|
[23] |
Shen Huawei, Cheng Xueqi, Cai Kai. Detect overlapping and hierarchical community structure in networks[J].Physical A:Statistical Mechanics and its Applications,2009,388(8):17061712.
|
[24] |
Wang Xiaohua,Jiao Licheng,Wu Jianshe.Adjusting from disjoint to overlapping community detection of complex networks[J].Physica A:Statistical Mechanics and its Applications,2009,388(24):50455056.
|
[25] |
Lusseau D.The emergent properties of a dolphin social network[J].Proceedings of the Royal Society B Biological Sciences,2003,270(suppl 2):186188.
|
[26] |
Lee C, Reid F, Mcdaid A, et al. Detecting highly overlapping community structure by greedy clique expansion[C]∥Proc of the 4th Workshop on Social Network Mining and Analysis held in Conjunction with the International Conference on Knowledge Discovery and Data Mining,2010:1.
|
|
附中文参考文献:
|
[14] |
张俊丽,常艳丽,师文.标签传播算法理论及其应用研究综述[J].计算机应用研究,2013,30(1):2125.
|
[15] |
刘大有,金弟,何东晓,等.复杂网络社区挖掘综述[J].计算机研究与发展,2013,50(10):21402154.
|
[16] |
李稚楹,杨武,谢治军.PageRank算法研究综述[J].计算机科学,2011,38(10A):185188.
|