A new algorithm for finding the communities surrounding a given node

Excepting Wu_Huberman algorithm, most existing community detection methods cannot allow for finding the particular communities to which a specified vertex belongs; however, Wu-Huberman algorithm need to know in advance that how many communities should be divided and then it cannot automatically detect an underlying community structure. According to divisive methods for finding a community structure based on edge betweenness measure, a new algorithm is presented to solve this problem. This new algorithm not only can speed up the betweenness calculation, but also can allow for automatically discovering the underlying communities surrounding a given node without having to find all communities of a graph.

[1]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[2]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  John Scott.  Social Network Analysis , 1988 .

[4]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[5]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..