通过子图内最优拓扑变化提高网络的扩散特性

Patryk Pazura, Jarosław Jankowski, Kamil Bortko, Piotr Bartków
{"title":"通过子图内最优拓扑变化提高网络的扩散特性","authors":"Patryk Pazura, Jarosław Jankowski, Kamil Bortko, Piotr Bartków","doi":"10.1145/3341161.3344823","DOIUrl":null,"url":null,"abstract":"In recent years, bustling online communities have focused a lot of attention on research dealing with information spreading. Through acquired knowledge about the characteristics of information spreading processes, we are able to influence their dynamics via the enhancement of propagation properties or by changing them to decrease their spread within a network. One of approaches is adding or removing connections within a network. While optimal linking within complex networks requires extensive computational resources, in this investigation, we focus on the optimization of the topology of small graphs within larger network structures. The study shows how the enhancement of propagation properties within small networks is preserved in bigger networks based on connected smaller graphs. We compare the results from combined small graphs with added links providing optimal spread and networks with additional random linking. The results show that improvements in linking within small sub-graphs with optimal linking improves the diffusional properties of the whole network.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Increasing the Diffusional Characteristics of Networks Through Optimal Topology Changes within Sub-graphs\",\"authors\":\"Patryk Pazura, Jarosław Jankowski, Kamil Bortko, Piotr Bartków\",\"doi\":\"10.1145/3341161.3344823\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, bustling online communities have focused a lot of attention on research dealing with information spreading. Through acquired knowledge about the characteristics of information spreading processes, we are able to influence their dynamics via the enhancement of propagation properties or by changing them to decrease their spread within a network. One of approaches is adding or removing connections within a network. While optimal linking within complex networks requires extensive computational resources, in this investigation, we focus on the optimization of the topology of small graphs within larger network structures. The study shows how the enhancement of propagation properties within small networks is preserved in bigger networks based on connected smaller graphs. We compare the results from combined small graphs with added links providing optimal spread and networks with additional random linking. The results show that improvements in linking within small sub-graphs with optimal linking improves the diffusional properties of the whole network.\",\"PeriodicalId\":403360,\"journal\":{\"name\":\"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3341161.3344823\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3341161.3344823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,蓬勃发展的网络社区将大量注意力集中在信息传播研究上。通过获得信息传播过程特征的知识,我们能够通过增强传播特性或通过改变它们来减少它们在网络中的传播来影响它们的动态。其中一种方法是在网络中添加或删除连接。虽然复杂网络中的最佳连接需要大量的计算资源,但在本研究中,我们将重点放在大型网络结构中小图拓扑的优化上。该研究展示了如何在基于连接的小图的大网络中保持小网络中传播特性的增强。我们比较了组合小图与提供最佳传播的附加链接和具有附加随机链接的网络的结果。结果表明,小子图间最优连接的改进改善了整个网络的扩散特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Increasing the Diffusional Characteristics of Networks Through Optimal Topology Changes within Sub-graphs
In recent years, bustling online communities have focused a lot of attention on research dealing with information spreading. Through acquired knowledge about the characteristics of information spreading processes, we are able to influence their dynamics via the enhancement of propagation properties or by changing them to decrease their spread within a network. One of approaches is adding or removing connections within a network. While optimal linking within complex networks requires extensive computational resources, in this investigation, we focus on the optimization of the topology of small graphs within larger network structures. The study shows how the enhancement of propagation properties within small networks is preserved in bigger networks based on connected smaller graphs. We compare the results from combined small graphs with added links providing optimal spread and networks with additional random linking. The results show that improvements in linking within small sub-graphs with optimal linking improves the diffusional properties of the whole network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural-Brane: An inductive approach for attributed network embedding Customer Recommendation Based on Profile Matching and Customized Campaigns in On-Line Social Networks Characterizing and Detecting Livestreaming Chatbots Two Decades of Network Science: as seen through the co-authorship network of network scientists Show me your friends, and I will tell you whom you vote for: Predicting voting behavior in social networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1