基于模体的社会网络特征分析

doi:10.3969/j.issn.1006-2475.2017.08.008

摘要/Abstract

摘要：

模体是存在于网络中的重要介观结构，模体发现是研究社会网络结构的重要手段，通过模体存在性的研究可以更好地理解社会网络的演化规律。基于RandESU方法研究不同类型网络的模体特征

。实验结果表明：在社会网络中节点不但具有与度大节点相连的倾向，也具有以更大概率形成“三元闭包”的社区特征；占据“结构洞”的节点数量少但是在信息传播过程中起关键作用。因此可以认为

社会网络的结构演化是由“优先连接”和“三元闭包”共同驱动的。

关键词: 社会网络, 网络演化, 模体, 三元闭包, 优先连接

Abstract:

Motif is an important mesoscopic structure which exists in networks. Motif discovery is a key problem in data analysis of social networks. By studying the existence of

motif in social networks topology structure， the evolution of networks can be understood better. The RandESU algorithm was used in motif detection and motif features

analysis. The difference of motifs features in social networks, power networks and Internet was compared and analyzed. The experimental result shows that social networks have

greater probabilities to form the structure of “triadic closure”. They have stronger community features and bigger clustering coefficients. And, nodes also have a tendency to

connect with the hubs nodes. We also find that although the number of nodes occupy “structural holes” is less, but it plays a key role in the information propagation. Through

research an important conclusions can be drawled: “preferential attachment” and “triadic closure” are the reasons for driving network evolution.


Key words: social networks, evolution of networks, motif, triadic closure, preferential attachment

中图分类号:

TP399

杨梓舒. 基于模体的社会网络特征分析[J]. 计算机与现代化, doi: 10.3969/j.issn.1006-2475.2017.08.008.

YANG Zishu. Using Motif to Characterize and Analyze Mesoscopic Features of Social Networks[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2017.08.008.

［1］ Watts D J, Strogatz S H. Collective dynamics of ‘smallworld’ networks［J］. Nature, 1998,393(6684):440-442.
［2］ Barabási A L, Albert R. Emergence of scaling in random networks［J］. Science, 1999,286(5439):509-512.
［3］ Yang Yang, Dong Yuxiao, Chawla N V. Microscopic evolution of social networks by triad position profile［J］. arXiv Preprint arXiv:1310.1525.
［4］ Klimek P, Thurner S. Triadic closure dynamics drives scaling laws in social multiplex networks［J］. New Journal of Physics, 2013,15(6):2012-2019.
［5］ Girvan M, Newman M E. Community structure in social and biological networks［C］// Proceedings of the National Academy of Sciences, 2002,99(12):7821-7826.
［6］ Holme P, Kim B J. Growing scalefree networks with tunable clustering［J］. Physical Review E, 2002,65(2):026107.
［7］ Li Menghui, Gao Liang, Fan Ying, et al. Emergence of global preferential attachment from local interaction［J］. New Journal of Physics, 2010,12(4):043029.
［8］ ShenOrr, Milo R, Mangan S, et al. Network motifs in the transcriptional regulation network of Escherichia coli［J］. Nature Genetics, 2002,31(1):64-68.
〖LL〗〖HJ2.0mm〗［9］ Milo R, Shenorr S, Itzkovitz S, et al. Network motifs: Simple building blocks of complex networks［J］. Science, 2002,298(5594):824-827.
［10］Gulbahce N, Lehmann S. The art of community detection［J］. BioEssays, 2008,30(10):934-938.
［11］Alon U. Network motifs: Theory and experimental approaches［J］. Nature Reviews Genetics, 2007,8(6):450-461.
［12］Fortunato S. Community detection in graphs［J］. Physics Reports, 2010,486(35):75-174.
［13］Krumov L. Local Structures Determine Performance within Complex Networks［D］. Darmstadt:Technische Universitt, 2010.
［14］Ugander J, Backstrom L, Kleinberg J. Subgraph frequencies: Mapping the empirical and extremal geography of large graph collections［C］// Proceedings of the 22nd

International Conference on World Wide Web. 2013:1307-1318.
［15］韩华,刘婉璐,吴翎燕. 基于模体的复杂网络测度量研究［J］. 物理学报, 2013,62(16):168904-1-168904-5.
［16］刘亮,韩传峰,缪莉莉,等. 基于子图结构对等的科学家合作网络角色辨识［J］. 科学学研究, 2013,31(8):1128-1135.
［17］董昭,李翔. 离散时间序列的网络模体分析［J］. 物理学报, 2010,59(3):1600-1607.
［18］Lee T I, Rinaldi N J, Robert F, et al. Transcriptional regulatory networks in Saccharomyces cerevisiae［J］. Science, 2002,298(5594):799-804.
［19］Tran N T L, Mohan S, Xu Zhuoqing, et al. Current innovations and future challenges of network motif detection［J］. Briefings in Bioinformatics, 2015,16(3):497-525.
［20］徐恪,张赛,陈昊,等. 在线社会网络的测量与分析［J］. 计算机学报, 2014,37(1):165-188.
［21］Kashtan N, Itzkovitz S, Milo R, et al. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs［J］. Bioinformatics, 2004,20

(11):1746-1758.
［22］Wernicke S. Efficient detection of network motifs［J］. IEEE/ACM Transactions on Computational Biology and Bioinformatics(TCBB), 2006,3(4):347-359.
［23］DWernicke S, Rasche F. FANMOD: A tool for fast network motif detection［J］. Bioinformatics, 2006,22(9):1152-1153.
［24］Stehlé J, Voirin N, Barrat A, et al. Highresolution measurements of facetoface contact patterns in a primary school［J］. PloS One, 2011,6(8):e23176.
［25］Wikipedia. Braess’s Paradox［EB/OL］. https://en.wikipedia.org/wiki/Braess%27s_paradox, 2016-12-09.

[1]	朱旭, 朱晓晓, 王继民. 基于Matrix Profile的时间序列变长模体挖掘[J]. 计算机与现代化, 2021, 0(05): 44-50.
[2]	陈婧怡，徐名海，杨溪，杜帆. 一种改进的HK社交网络建模方法[J]. 计算机与现代化, 2019, 0(02): 123-.
[3]	金超，张龙波，王海鹏，安建瑞，怀浩，王晓丹. 一种基于结构相似性的图聚类算法[J]. 计算机与现代化, 2016, 0(3): 19-23.
[4]	梁智学;齐立磊. 基于iPhone平台的航班LBS系统[J]. 计算机与现代化, 2013, 1(9): 121-125.
[5]	黄国伟;陈志. 基于社会网络的两阶段垃圾邮件过滤方法[J]. 计算机与现代化, 2013, 1(7): 43-046,.
[6]	杨静;王靖. 基于聚类分析检索团伙多起犯罪的迭代算法 [J]. 计算机与现代化, 2013, 1(1): 1-4.
[7]	张韦全;陈京民. 基于社会网络挖掘的微博参政群体实证研究[J]. 计算机与现代化, 2012, 1(201): 67-70.
[8]	孙祯桢;渠文博;倪奕. 科学家、组织与技术及其关系的社会网络分析[J]. 计算机与现代化, 2012, 1(11): 158-161.

基于模体的社会网络特征分析

Using Motif to Characterize and Analyze Mesoscopic Features of Social Networks

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 8

编辑推荐

Metrics

本文评价