Finding Community Structure and Evaluating Hub Road Section in Urban Traffic Network

摘要

An algorithm is proposed to find out community structure and evaluate Hub road section in urban traffic network based on GN algorithm (Girvan and Newman, 2004), namely GN-T algorithm. The algorithm involves iterative removals of links to split urban traffic network into communities, in which the removed links are identified by “maximal between-value”, and the remainders need to be recalculated after each removal. An improved modularity is also presented to determine the appropriate numbers of community structure into which urban traffic network should be divided. A case study on Wuchang shows the urban traffic network possesses the characteristics of community structure, and the Hub road sections in this network derived from the algorithm is consistent with actual situation. The results demonstrate the algorithm is highly effective and available.