{"title":"自组织通信网络中拓扑社区的社会相关性","authors":"Guillaume-Jean Herbiet, P. Bouvry, F. Guinand","doi":"10.1109/CASON.2011.6085912","DOIUrl":null,"url":null,"abstract":"In this article, we investigate the social relevance of dynamic community structures that can be determined on dynamic communication networks. We first present and validate SAND/SHARC (Stability And Network Dynamics over Sharper Heuristic for Assignment of Robust Communities), a distributed algorithm for community detection. Then, based on real-world communication traces and social information, we evaluate how the structures found by SAND/SHARC can be translated to social links and favor interaction between users with similar social characteristics. Such a study is important to envision community detection algorithm in the design of ubiquitous social interaction protocols, like those used in mobile social networks (MoSoNets).","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Social relevance of topological communities in ad hoc communication networks\",\"authors\":\"Guillaume-Jean Herbiet, P. Bouvry, F. Guinand\",\"doi\":\"10.1109/CASON.2011.6085912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we investigate the social relevance of dynamic community structures that can be determined on dynamic communication networks. We first present and validate SAND/SHARC (Stability And Network Dynamics over Sharper Heuristic for Assignment of Robust Communities), a distributed algorithm for community detection. Then, based on real-world communication traces and social information, we evaluate how the structures found by SAND/SHARC can be translated to social links and favor interaction between users with similar social characteristics. Such a study is important to envision community detection algorithm in the design of ubiquitous social interaction protocols, like those used in mobile social networks (MoSoNets).\",\"PeriodicalId\":342597,\"journal\":{\"name\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASON.2011.6085912\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASON.2011.6085912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
在本文中,我们研究动态社区结构的社会相关性,动态社区结构可以在动态通信网络上确定。我们首先提出并验证了SAND/SHARC (Stability and Network Dynamics over Sharper Heuristic for Assignment of Robust Communities),这是一种用于社区检测的分布式算法。然后,基于现实世界的交流痕迹和社会信息,我们评估了SAND/SHARC发现的结构如何转化为社会链接,并有利于具有相似社会特征的用户之间的互动。这样的研究对于设想社区检测算法在无处不在的社交交互协议的设计中是很重要的,就像那些在移动社交网络(MoSoNets)中使用的那样。
Social relevance of topological communities in ad hoc communication networks
In this article, we investigate the social relevance of dynamic community structures that can be determined on dynamic communication networks. We first present and validate SAND/SHARC (Stability And Network Dynamics over Sharper Heuristic for Assignment of Robust Communities), a distributed algorithm for community detection. Then, based on real-world communication traces and social information, we evaluate how the structures found by SAND/SHARC can be translated to social links and favor interaction between users with similar social characteristics. Such a study is important to envision community detection algorithm in the design of ubiquitous social interaction protocols, like those used in mobile social networks (MoSoNets).