Quantifying encircling behaviour in complex networks

Piraveenan Mahendra, M. S. Uddin, K. S. Chung, D. Kasthurirathna
{"title":"Quantifying encircling behaviour in complex networks","authors":"Piraveenan Mahendra, M. S. Uddin, K. S. Chung, D. Kasthurirathna","doi":"10.1109/CICYBS.2013.6597199","DOIUrl":null,"url":null,"abstract":"In this paper, we explore the effect of encircling behaviour on the topology of complex networks. We introduce the concept of topological encircling, which we define as an attacker making links to neighbours of a victim with the ultimate aim of undermining that victim. We introduce metrics to quantify topological encircling in complex networks, both at the network level and node pair (link) level. Using synthesized networks, we demonstrate that our measures are able to distinguish intentional topological encircling from preferential mixing. We discuss the potential utility of our measures and future research directions.","PeriodicalId":178381,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence in Cyber Security (CICS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Symposium on Computational Intelligence in Cyber Security (CICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICYBS.2013.6597199","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 explore the effect of encircling behaviour on the topology of complex networks. We introduce the concept of topological encircling, which we define as an attacker making links to neighbours of a victim with the ultimate aim of undermining that victim. We introduce metrics to quantify topological encircling in complex networks, both at the network level and node pair (link) level. Using synthesized networks, we demonstrate that our measures are able to distinguish intentional topological encircling from preferential mixing. We discuss the potential utility of our measures and future research directions.
复杂网络中环形行为的量化
在本文中,我们探讨了环绕行为对复杂网络拓扑结构的影响。我们引入了拓扑包围的概念,我们将其定义为攻击者与受害者的邻居建立联系,最终目的是破坏受害者。我们在网络级和节点对(链路)级引入度量来量化复杂网络中的拓扑包围。利用合成网络,我们证明了我们的措施能够区分有意的拓扑包围和优先混合。我们讨论了这些措施的潜在效用和未来的研究方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信