Community Structure based on Node Traffic in Networks

Abhineet Anand, Vikas Kr. Sihag, P S V S Sridhar
2013 International Journal of Computer Applications  
Finding community structure in networks has been always the prerequisite for the analysis of network structure and its properties. Based on node traffic, an efficient method for calculating betweenness measure is proposed. It is used iteratively to remove edges with high betweenness score from the network, thus splitting network into communities. The score is recalculated after each removal. The algorithm is best suited for networks with traffic generation capabilities.
doi:10.5120/11901-7966 fatcat:ahl2anljovgdrjd4pot6sizgeu