Mısra, SanjayBehera, Ranjan KumarRath, Santanu KumarMisra, SanjayDamasevicius, RobertasMaskeliunas, RytisComputer Engineering2024-07-052024-07-052017322076-341710.3390/app71111732-s2.0-85034256334https://doi.org/10.3390/app7111173https://hdl.handle.net/20.500.14411/2941BEHERA, RANJAN KUMAR/0000-0001-9267-3621; Damaševičius, Robertas/0000-0001-9990-1084; Maskeliunas, Rytis/0000-0002-2809-2213; Misra, Sanjay/0000-0002-3556-9331; Rath, Santanu/0000-0001-5641-8199In a social network, small or large communities within the network play a major role in deciding the functionalities of the network. Despite of diverse definitions, communities in the network may be defined as the group of nodes that are more densely connected as compared to nodes outside the group. Revealing such hidden communities is one of the challenging research problems. A real world social network follows small world phenomena, which indicates that any two social entities can be reachable in a small number of steps. In this paper, nodes are mapped into communities based on the random walk in the network. However, uncovering communities in large-scale networks is a challenging task due to its unprecedented growth in the size of social networks. A good number of community detection algorithms based on random walk exist in literature. In addition, when large-scale social networks are being considered, these algorithms are observed to take considerably longer time. In this work, with an objective to improve the efficiency of algorithms, parallel programming framework like Map-Reduce has been considered for uncovering the hidden communities in social network. The proposed approach has been compared with some standard existing community detection algorithms for both synthetic and real-world datasets in order to examine its performance, and it is observed that the proposed algorithm is more efficient than the existing ones.eninfo:eu-repo/semantics/openAccesssmall world networksix degrees of separationmap reducecommunity detectionmodularitynormalize mutual informationArticleQ2711WOS:000416794600072