Overlapping Community Detection by Local Decentralised Vertex-centred Process

2017/02/13 by Canu, Maël, Lesot, Marie-Jeanne, d'Allonnes, Adrien Revault
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Social and Information Networks (cs.SI)

paper · doi:10.48550/arxiv.1702.03773

Abstract

This paper focuses on the identification of overlapping communities, allowing nodes to simultaneously belong to several communities, in a decentralised way. To that aim it proposes LOCNeSs, an algorithm specially designed to run in a decentralised environment and to limit propagation, two essential characteristics to be applied in mobile networks. It is based on the exploitation of the preferential attachment mechanism in networks. Experimental results show that LOCNeSs is stable and achieves good overlapping vertex identification.

Related

• Fast community structure local uncovering by independent vertex-centred process
• Overlapping community detection in networks based on link partitioning\n and partitioning around medoids
• Node-Centric Detection of Overlapping Communities in Social Networks
• Shared Nodes of Overlapping Communities in Complex Networks
• A Modular Multiscale Approach to Overlapping Community Detection