QQ客服 官方微博 反馈留言

	Detecting groups of similar components in complex networks
	Wang, J. ; Lai, C. H. ; Wang J(王矫)
	2008
关键词	COMMUNITY STRUCTURE MODULARITY
英文摘要	We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (2007 Proc. Natl. Acad. Sci. USA 104 9564), we develop an algorithm that is applicable to a network with any degree distribution. The partition of a network suggested by this algorithm also applies to its complementary network. In general, groups of similar components are not necessarily identical with the communities in a community network; thus partitioning a network into groups of similar components provides additional information of the network structure. The proposed algorithm can also be used for community detection when the groups and the communities overlap. By introducing a tunable parameter that controls the involved effects of the heterogeneity, we can also investigate conveniently how the group structure can be coupled with the heterogeneity characteristics. In particular, an interesting example shows a group partition can evolve into a community partition in some situations when the involved heterogeneity effects are tuned. The extension of this algorithm to weighted networks is discussed as well.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/69704]
专题	物理技术－已发表论文
推荐引用方式 GB/T 7714	Wang, J.,Lai, C. H.,Wang J. Detecting groups of similar components in complex networks[J],2008.
APA	Wang, J.,Lai, C. H.,&王矫.(2008).Detecting groups of similar components in complex networks..
MLA	Wang, J.,et al."Detecting groups of similar components in complex networks".(2008).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。