位置:成果数据库 > 期刊 > 期刊详情页
跨越多个实际科学领域的合作网络与合作-竞争网络
  • ISSN号:1000-0992
  • 期刊名称:《力学进展》
  • 时间:0
  • 分类:TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术] P9[天文地球—自然地理学]
  • 作者机构:[1]College of Information Engineering, Yangzhou University, Yangzhou 225009, China, [2]College of Physics Science and Technology, Yangzhou University, Yangzhou 225009, China
  • 相关基金:Project supported by the National Natural Science Foundation of China (Grant Nos. 70671089 and 10635040).
中文摘要:

In a network described by a graph,only topological structure information is considered to determine how the nodes are connected by edges.Non-topological information denotes that which cannot be determined directly from topological information.This paper shows,by a simple example where scientists in three research groups and one external group form four communities,that in some real world networks non-topological information (in this example,the research group affiliation) dominates community division.If the information has some influence on the network topological structure,the question arises as to how to find a suitable algorithm to identify the communities based only on the network topology.We show that weighted Newman algorithm may be the best choice for this example.We believe that this idea is general for real-world complex networks.

英文摘要:

In a network described by a graph, only topological structure information is considered to determine how the nodes are connected by edges. Non-topological information denotes that which cannot be determined directly from topological information. This paper shows, by a simple example where scientists in three research groups and one external group form four communities, that in some real world networks non-topological information (in this example, the research group affiliation) dominates community division. If the information has some influence on the network topological structure, the question arises as to how to find a suitable algorithm to identify the communities based only on the network topology. We show that weighted Newman algorithm may be the best choice for this example. We believe that this idea is general for real-world complex networks.

同期刊论文项目
期刊论文 33 会议论文 38
同项目期刊论文
期刊信息
  • 《力学进展》
  • 北大核心期刊(2014版)
  • 主管单位:中国科学院
  • 主办单位:中国科学院力学研究所 中国力学学会
  • 主编:樊菁
  • 地址:北京市海淀区北四环西路15号
  • 邮编:100190
  • 邮箱:lxjz@cstam.org.cn
  • 电话:010-62637035
  • 国际标准刊号:ISSN:1000-0992
  • 国内统一刊号:ISSN:11-1774/O3
  • 邮发代号:82-331
  • 获奖情况:
  • 1996、2000年分别获中科院优秀期刊三等、二等奖,1998年列入数理力学类的第三名,中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 德国数学文摘,荷兰文摘与引文数据库,美国工程索引,日本日本科学技术振兴机构数据库,美国应用力学评论,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:13273