RANKING NODES IN COMPLEX NETWORKS: A CASE STUDY OF THE GAUBUS

Abstract

Abstract. Connecting points of interest through a well-planned, inter-connected network provides manifold benefits to commuters and service providers. In the South African context, traffic congestion has become of great concern. Given how the South Africa community is slowly developing towards the use of multi-modes of mobility, the Gautrain network can be used to promote the use of multi-modes of mobility, as the Gautrain has been identified as the backbone of mobility within the Gauteng province. Currently commuters have the option to board the Gaubus (a form of Bus Rapid Transit) at their origin points which will take them to the Gautrain station to board the Gautrain. The problem to be solved arises when a commuter wishes to traverse from any bus stop to the Gautrain station, currently he/she only has one option and if the bus network has a shutdown at any point in the network the commuter’s journey will not be possible. In solving this problem, we consider the problem of graph robustness (that is creating new alternative routes to increase node/bus stop connectivity). We initial use Strava data, to identify locations were cyclist prefer to cycle and at what time of day. In graph theory, the nodes with most spreading ability are called influential nodes. Identification of most influential nodes and ranking them based on their spreading ability is of vital importance. Closeness centrality and betweenness are one of the most commonly used methods to identify influential nodes in complex networks. Using the Gaubus network we identify the influential nodes/ bus stops, using the betweenness centrality measure. The results reveal the influential nodes with the highest connectivity as these have cross-connections in the network. Identification of the influential nodes presents an important implication for future planning, accessibility, and, more generally, quality of life.