Analysis of six degrees of separation in Facebook using Ant colony optimization

E. E. Lawrence, R. Latha
{"title":"Analysis of six degrees of separation in Facebook using Ant colony optimization","authors":"E. E. Lawrence, R. Latha","doi":"10.1109/ICCPCT.2015.7159171","DOIUrl":null,"url":null,"abstract":"Six degrees of separation is a popular theory that is widely accepted by many people, which states any two people on this world can be connected through an average number of six steps. Though there is no solid scientific evidence that the six degrees of separation theory is true, it remains as an area of interest to social researches. With the advent of digital mapping, the theory can now be tested with social networks, but will the theory of six degrees of separation hold for the virtual world? The link between any two people in a graph with number of hops needs to be identified and that can be done efficiently with the help of Ant colony optimization technique (ACO). As ACO algorithms are proved to be efficient with a broad range of NP hard problems such as the traveling salesman problem (TSP) or the quadratic assignment problem (QAP), and is increasingly gaining interest for solving real life engineering and scientific problems, an attempt has been made in this paper to analyze the six degrees of separation in the popular social network Facebook which has over 1.3 billion active users as of June 2014.","PeriodicalId":6650,"journal":{"name":"2015 International Conference on Circuits, Power and Computing Technologies [ICCPCT-2015]","volume":"152 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Circuits, Power and Computing Technologies [ICCPCT-2015]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCPCT.2015.7159171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Six degrees of separation is a popular theory that is widely accepted by many people, which states any two people on this world can be connected through an average number of six steps. Though there is no solid scientific evidence that the six degrees of separation theory is true, it remains as an area of interest to social researches. With the advent of digital mapping, the theory can now be tested with social networks, but will the theory of six degrees of separation hold for the virtual world? The link between any two people in a graph with number of hops needs to be identified and that can be done efficiently with the help of Ant colony optimization technique (ACO). As ACO algorithms are proved to be efficient with a broad range of NP hard problems such as the traveling salesman problem (TSP) or the quadratic assignment problem (QAP), and is increasingly gaining interest for solving real life engineering and scientific problems, an attempt has been made in this paper to analyze the six degrees of separation in the popular social network Facebook which has over 1.3 billion active users as of June 2014.
基于蚁群优化的Facebook六度分离分析
六度分离是一个被许多人广泛接受的流行理论,它认为世界上任何两个人都可以通过平均六个步骤连接起来。虽然没有确凿的科学证据证明六度分离理论是正确的,但它仍然是社会研究的一个感兴趣的领域。随着数字地图的出现,这一理论现在可以在社交网络上得到检验,但六度分隔理论是否适用于虚拟世界?在一个有跳数的图中,任意两个人之间的联系需要被识别,这可以借助蚁群优化技术(ACO)有效地完成。由于蚁群算法被证明在解决旅行推销员问题(TSP)或二次分配问题(QAP)等广泛的NP困难问题上是有效的,并且在解决现实生活中的工程和科学问题方面越来越受到关注,因此本文试图分析流行的社交网络Facebook中的六度分离,截至2014年6月,Facebook拥有超过13亿的活跃用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信