Vertex Importance Extension of Betweenness Centrality Algorithm
- 517 Downloads
Variety of real-life structures can be simplified by a graph. Such simplification emphasizes the structure represented by vertices connected via edges. A common method for the analysis of the vertices importance in a network is betweenness centrality. The centrality is computed using the information about the shortest paths that exist in a graph. This approach puts the importance on the edges that connect the vertices. However, not all vertices are equal. Some of them might be more important than others or have more significant influence on the behavior of the network. Therefore, we introduce the modification of the betweenness centrality algorithm that takes into account the vertex importance. This approach allows the further refinement of the betweenness centrality score to fulfill the needs of the network better. We show this idea on an example of the real traffic network. We test the performance of the algorithm on the traffic network data from the city of Bratislava, Slovakia to prove that the inclusion of the modification does not hinder the original algorithm much. We also provide a visualization of the traffic network of the city of Ostrava, the Czech Republic to show the effect of the vertex importance adjustment. The algorithm was parallelized by MPI (http://www.mpi-forum.org/) and was tested on the supercomputer Salomon (https://docs.it4i.cz/) at IT4Innovations National Supercomputing Center, the Czech Republic.
KeywordsBetweenness centrality High performance computing MPI Traffic network
This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPU II) project ‘IT4Innovations excellence in science—LQ1602’, by the IT4Innovations infrastructure which is supported from the Large Infrastructures for Research, Experimental Development and Innovations project “IT4Innovations National Supercomputing Center—LM2015070”, and partially by ANTAREX, a project supported by the EU H2020 FET-HPC program under grant 671,623, and by grant of SGS No. SP2017/182 “Solving graph problems on spatio-temporal graphs with uncertainty using HPC”, VŠB—Technical University of Ostrava, Czech Republic.
- 9.He, T., Zhao, J., Li, J. (2006). Discovering relations among named entities by detecting community structure. In PACLIC20 (pp. 42–48).Google Scholar
- 10.Donges, J. F., Zou, Y., Marwan, N., & Kurths, J. (2009). The backbone of the climate network. EPL (Europhysics Letters), 87.Google Scholar
- 11.Zhang, G. Q., Wang, D., & Li, G. J. (2007). Enhancing the transmission efficiency by edge deletion in scale-free networks. Physical Review E, 76.Google Scholar
- 12.Zhou, S., & Mondragón, R. J. (2004). Accurately modeling the internet topology. Physical Review E, 70.Google Scholar
- 13.Comin, C. H., & Da Fontoura Costa, L. (2011). Identifying the starting point of a spreading process in complex networks. Physical Review E, 84.Google Scholar
- 18.Ngoduy, D. (2007). Real time multiclass traffic flow modelling-English M25 freeway case study. In 12th Conference of the Hong-Kong Society for Transportation Studies (pp. 143–152).Google Scholar
- 21.Galafassi, C., & Bazzan, A. L. C. (2013). Analysis of traffic behavior in regular grid and real world networks.Google Scholar
- 22.Kazerani, A., & Winter, S. (2009). Can betweenness centrality explain traffic flow? In 12th AGILE International Conference on Geographic Information Science (pp. 1–9).Google Scholar
- 23.Gao, S., Wang, Y., Gao, Y., & Liu, Y. (2012). Understanding urban traffic flow characteristics: A rethinking of betweenness centrality. Environment and Planning B: Planning and Design.Google Scholar
- 28.Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology.Google Scholar