Fast unfolding of community hierarchies in large networks

摘要: Introduction The typical size of large networks such as social network services, mobile phone or the web now counts in millions when not billions nodes and these scales demand new methods to retrieve comprehensive information from their structure. A promising approach consists decomposing into communities strongly connected nodes, with belonging different only sparsely connected. Finding exact optimal partitions is known be computationally intractable, mainly due explosion number possible increases. It therefore high interest propose algorithms find reasonably “good” solutions problem a “fast” way. One fastest optimizing modularity partition greedy way (Clauset et al, 2004), method that, even improved, does allow analyze more than few (Wakita 2007).