从没有增长的小世界网络中获得无标度网络

Guangping Chen, Jiabo Hao, Zhiyuan Zhang, Yumei Tang
{"title":"从没有增长的小世界网络中获得无标度网络","authors":"Guangping Chen, Jiabo Hao, Zhiyuan Zhang, Yumei Tang","doi":"10.1109/ICACI.2012.6463112","DOIUrl":null,"url":null,"abstract":"A method that can be used to get scale-free network from a small-world network without growth under the mechanism of preferential attachment is proposed. Unlike the normal BA growth network model, in our model we remove an old node with a probability scaling with the degree of the node before adding a new node into the network, that make the size of the network fixed, but the nodes and edges are not fixed. If an old node has less degree, it has a larger probability to be removed, and its edges are deleted at the same time. It is found that the degree distribution based on our model obeys a form like power-law of BA model, but the scope of degree distribution in our model is much smaller than BA model. Therefore, the degree distribution's heave tail in our model is thinner than that in the normal BA model; thus it is different from the normal BA model. Meanwhile, there are some other properties in our model, for instance, the average clustering coefficient decreases with the renewed ratio and the power-law exponent increases with the renewed ratio to a limited value, which is equal to that in the normal BA model.","PeriodicalId":404759,"journal":{"name":"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Getting scale-free network from a small world network without growth\",\"authors\":\"Guangping Chen, Jiabo Hao, Zhiyuan Zhang, Yumei Tang\",\"doi\":\"10.1109/ICACI.2012.6463112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method that can be used to get scale-free network from a small-world network without growth under the mechanism of preferential attachment is proposed. Unlike the normal BA growth network model, in our model we remove an old node with a probability scaling with the degree of the node before adding a new node into the network, that make the size of the network fixed, but the nodes and edges are not fixed. If an old node has less degree, it has a larger probability to be removed, and its edges are deleted at the same time. It is found that the degree distribution based on our model obeys a form like power-law of BA model, but the scope of degree distribution in our model is much smaller than BA model. Therefore, the degree distribution's heave tail in our model is thinner than that in the normal BA model; thus it is different from the normal BA model. Meanwhile, there are some other properties in our model, for instance, the average clustering coefficient decreases with the renewed ratio and the power-law exponent increases with the renewed ratio to a limited value, which is equal to that in the normal BA model.\",\"PeriodicalId\":404759,\"journal\":{\"name\":\"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI.2012.6463112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI.2012.6463112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种在优先依恋机制下由无生长的小世界网络得到无标度网络的方法。与普通的BA增长网络模型不同,在我们的模型中,我们在向网络中添加新节点之前,先以节点的程度为概率尺度移除一个旧节点,这使得网络的大小是固定的,但节点和边是不固定的。旧节点度越小,被移除的概率越大,同时删除其边。研究发现,基于该模型的度分布服从于BA模型的幂律形式,但该模型的度分布范围远小于BA模型。因此,我们的模型的度分布的起伏尾比正常的BA模型要细;因此它不同于一般的BA模型。同时,我们的模型还具有一些其他的特性,如平均聚类系数随着更新比的增加而减小,幂律指数随着更新比的增加而增大到一个有限的值,这与常规BA模型相等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Getting scale-free network from a small world network without growth
A method that can be used to get scale-free network from a small-world network without growth under the mechanism of preferential attachment is proposed. Unlike the normal BA growth network model, in our model we remove an old node with a probability scaling with the degree of the node before adding a new node into the network, that make the size of the network fixed, but the nodes and edges are not fixed. If an old node has less degree, it has a larger probability to be removed, and its edges are deleted at the same time. It is found that the degree distribution based on our model obeys a form like power-law of BA model, but the scope of degree distribution in our model is much smaller than BA model. Therefore, the degree distribution's heave tail in our model is thinner than that in the normal BA model; thus it is different from the normal BA model. Meanwhile, there are some other properties in our model, for instance, the average clustering coefficient decreases with the renewed ratio and the power-law exponent increases with the renewed ratio to a limited value, which is equal to that in the normal BA model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信