期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于节点动态连接度的网络社团划分算法 被引量:6
1
作者 贾珺 胡晓峰 贺筱媛 《复杂系统与复杂性科学》 EI CSCD 北大核心 2016年第4期56-61,共6页
首先定义了节点动态连接度这一概念,然后介绍了基于节点动态连接度的网络社团划分算法,之后再对其中相关参数的取值范围和社团划分结果之间的关系进行了分析,并以Zachary网络为例验证了分析结论。在此基础上,以dolphins、polbooks和foot... 首先定义了节点动态连接度这一概念,然后介绍了基于节点动态连接度的网络社团划分算法,之后再对其中相关参数的取值范围和社团划分结果之间的关系进行了分析,并以Zachary网络为例验证了分析结论。在此基础上,以dolphins、polbooks和football 3个实际网络为对象,进行了社团划分实验,证明了本算法可通过动态调整参数实现对不同网络的社团划分。最后将实验结果与其他几种常见的社团划分算法结果进行了比较,证明了算法的优势,并对算法中需要注意的一些问题进行了说明。 展开更多
关键词 节点动态连接度 社团结构 社团划分
下载PDF
Modeling Dynamic Evolution of Online Friendship Network
2
作者 吴联仁 闫强 《Communications in Theoretical Physics》 SCIE CAS CSCD 2012年第10期599-603,共5页
In this paper,we study the dynamic evolution of friendship network in SNS(Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has wi... In this paper,we study the dynamic evolution of friendship network in SNS(Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community,but also on the friendship network generated by those friends.In addition,we propose a model which is based on two processes:first,connecting nearest neighbors;second,strength driven attachment mechanism.The model reflects two facts:first,in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor;second,new nodes connect more likely to nodes which have larger weights and interactions,a phenomenon called strength driven attachment(also called weight driven attachment).From the simulation results,we find that degree distribution P(k),strength distribution P(s),and degree-strength correlation are all consistent with empirical data. 展开更多
关键词 friendship network common neighbor CNN strength driven
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部