Measuring diversity of network models using distorted information diffusion process

P. Pandey, Bibhas Adhikari, Ruchir Gupta
{"title":"Measuring diversity of network models using distorted information diffusion process","authors":"P. Pandey, Bibhas Adhikari, Ruchir Gupta","doi":"10.1109/COMSNETS.2015.7098729","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a distorted information diffusion protocol to detect diversity of different network models. The protocol is inspired by the fact that, in real social networks, the information diffusion get influenced by the property of nodes and conduct of the links. Thus, information get deformed/distorted during diffusion process and true amount of information from a spreader never reach to all the nodes in the network. We consider a single spreader which has maximum degree in the network. We divide the entire network in to different layers where the nodes in a layer are defined by the nodes having a fixed distance from the spreader. We observe that the amount of information available at every node in a layer after the diffusion process reaches to saturation, is not equal. Thus, we define density of information profile of a layer that measures the density of information available in a layer. Finally, we define a vector, which we call information diversity vector whose components are density of information of the layers. The dimension of the diversity vector is the number of layers in the entire network. We implement the protocol in standard network models which include Albert-Barabasi preferential attachment Model (ABM), Hierarchical network generation Model (HM), and Watts-Strogatz Model (WSM). We also simulate the protocol in real world networks which include ego-Facebook Network, Collaboration network of ArXiv General Relativity, and Collaboration network of ArXiv High Energy Physics Theory. The simulated results show that the information diversity vectors of ABM and HM is far from reflecting the same in real world networks. However, diversity vector of WSM is similar to that of real world networks which we consider in this paper.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2015.7098729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a distorted information diffusion protocol to detect diversity of different network models. The protocol is inspired by the fact that, in real social networks, the information diffusion get influenced by the property of nodes and conduct of the links. Thus, information get deformed/distorted during diffusion process and true amount of information from a spreader never reach to all the nodes in the network. We consider a single spreader which has maximum degree in the network. We divide the entire network in to different layers where the nodes in a layer are defined by the nodes having a fixed distance from the spreader. We observe that the amount of information available at every node in a layer after the diffusion process reaches to saturation, is not equal. Thus, we define density of information profile of a layer that measures the density of information available in a layer. Finally, we define a vector, which we call information diversity vector whose components are density of information of the layers. The dimension of the diversity vector is the number of layers in the entire network. We implement the protocol in standard network models which include Albert-Barabasi preferential attachment Model (ABM), Hierarchical network generation Model (HM), and Watts-Strogatz Model (WSM). We also simulate the protocol in real world networks which include ego-Facebook Network, Collaboration network of ArXiv General Relativity, and Collaboration network of ArXiv High Energy Physics Theory. The simulated results show that the information diversity vectors of ABM and HM is far from reflecting the same in real world networks. However, diversity vector of WSM is similar to that of real world networks which we consider in this paper.
利用扭曲信息扩散过程测量网络模型的多样性
在本文中,我们提出了一种扭曲信息扩散协议来检测不同网络模型的多样性。该协议的灵感来自于在真实的社交网络中,信息的扩散受到节点属性和链路行为的影响。这样,信息在传播过程中就会发生变形/扭曲,一个传播者的真实信息量不可能到达网络中的所有节点。我们考虑在网络中具有最大度的单个传播者。我们将整个网络划分为不同的层,其中一层中的节点由与散布器有固定距离的节点定义。我们观察到,扩散过程达到饱和后,层中每个节点的可用信息量是不相等的。因此,我们定义了层的信息密度剖面,该剖面测量了层中可用信息的密度。最后,我们定义了一个向量,我们称之为信息多样性向量,它的组成部分是各层信息的密度。多样性向量的维数是整个网络的层数。我们在标准网络模型中实现了该协议,包括Albert-Barabasi优先依恋模型(ABM)、分层网络生成模型(HM)和Watts-Strogatz模型(WSM)。我们还在现实网络中模拟了该协议,包括ego-Facebook网络、ArXiv广义相对论协作网络和ArXiv高能物理理论协作网络。仿真结果表明,ABM和HM的信息分集向量在实际网络中反映的情况相差甚远。然而,WSM的多样性向量与本文所考虑的现实世界网络的多样性向量相似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信