Logo image
Back
Detection of network communities with memory-biased random walk algorithms
Journal article

Detection of network communities with memory-biased random walk algorithms

Mesut Yucel, Lev Muchnik and Uri Hershberg
Journal of complex networks, v 5(1), pp 48-69
01 Mar 2017
DOI: https://doi.org/10.1093/comnet/cnw007

Abstract

Mathematics Mathematics, Interdisciplinary Applications Physical Sciences Science & Technology
Community structure and its detection in complex networks has been the subject of many studies in the recent years. Towards this goal, we have created a novel approach based on the analysis of the motion of a memory-biased random walker, i.e. an entity that traverses the network with some tendency to follow or avoid pathways it has previously traversed. We found that the walker tends to remain inside communities, that is, subsets of the network nodes which are more connected to each other, rather than to the rest of the network. Based on this trait of the MBRW we developed a method to detect communities and tested its performance on a range of networks with different levels of community structure. In all tested cases, the method proved to be at least as effective as Girvan-Newman or Infomap while outperforming them when communities were less well defined.

Metrics

5 Record Views
4 citations in Web of Science
5 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Mathematics, Interdisciplinary Applications
Logo image