Jie Zhang et al 2009 New J. Phys. 11 113003 doi:10.1088/1367-2630/11/11/113003
Jie Zhang1,4, Kai Zhang2, Xiao-ke Xu1,3, Chi K Tse1 and Michael Small1
Show affiliationsCurrent endeavors in community detection suffer from the resolution limit problem and can be quite expensive for large networks, especially those based on optimization schemes. We propose a conceptually different approach for multi-resolution community detection, by introducing the kernels from statistical literature into the graph, which mimic the node interaction that decays locally with the geodesic distance. The modular structure naturally arises as the patterns inherent in the interaction landscape, which can be easily identified by the hill climbing process. The range of node interaction, and henceforth the resolution of community detection, is controlled via tuning the kernel bandwidth in a systematic way. Our approach is computationally efficient and its effectiveness is demonstrated using both synthetic and real networks with multiscale structures.
Issue 11 (November 2009)
Received 24 August 2009
Published 2 November 2009
Jie Zhang et al 2009 New J. Phys. 11 113003
Shuichi Murakami 1998 J. Phys. A: Math. Gen. 31 6367
William T Shi et al 2006 Phys. Med. Biol. 51 4031
Xianzhou Zhang et al 2003 J. Phys. B: At. Mol. Opt. Phys. 36 4089
M Bruschi et al 2009 J. Phys. A: Math. Theor. 42 475202
D J Raine and D W Sciama 1997 Class. Quantum Grav. 14 A325
Zhibin Lin and Roland E Allen 2009 J. Phys.: Condens. Matter 21 485503
Masamune Oguri et al. 2005 ApJ 622 106
J.E. Menard et al 2007 Nucl. Fusion 47 S645
Yuhu Zhai and Mark D Bird 2008 Supercond. Sci. Technol. 21 115010