B. Are Public Transport Networks Scale-Free? Following the random network model proposed by Paul Erdo˝s and Alfréd Rényi [38], many real-world networks were verified to be connected in a random way, in which a myriad number of nodes in the network exhibit similar degree since the nodes are connected randomly. The degree distribution of such a random network is more likely to follow a Poisson distribution [38], [39]. However, Barabási [2], [5], [40], [41] showed a unique References behavior in which a few nodes in the network exhibit very high degree while a large number [17] of nodes exhibit low degree, and the degree [27] distribution of such network is expected to readily identified via studying the node degree. In addition, the study of the degree distribution in a network would benefit the evaluation of an interesting network property called the scale-free property. Table VI. Empirical values of various network parameters in C-space representation. Gk H CD Gd H r 11.09-151.72 2.14-28.3 1.7-4 +ve 98.1 * * * Bus Transport Network Appendix C: Network Parameters in Different Spaces of Representation 50 Parameter L-space P-space C-space B-space Degree Number of neighboring stops that a given stop is connected to Number of stops accessible from a given stop with or without making a transfer Number of overlapped routes Number of stations serviced by a route (in L proj graph) or number of routes a station is connected to (in N proj graph) Local clustering (transitivity) Cohesiveness among the neighbors of a node considering the physical infrastructure Cohesiveness among the neighbors of a node considering the actual connectivity Cohesiveness among the neighbors of a node considering the common stops serviced along the routes Cohesiveness between the routes and stops in a network Average path length Total number of links (hops) to be traversed between the chosen O-D Total number of transfers to be taken to travel between the chosen O-D - - Betweenness centrality Node significance based on the number of shortest path routes that can traverse via the given node Node significance based on the number of transfers than can be handled by the given node - - Closeness centrality Reachability of a node with respect to every other node in the network Reachability of a node with respect to other routes in the network considering the number of transfers - - Assortativity Correlation level between similar degree stops in the network Correlation level between similar degree routes in the network Correlation between similar degree routes based on their overlapping - Communities Identifying different zones in the network based on a behavior of the stops and their connectivity Identifying different zones in a network based on the behavior of the routes Identifying different zones in the network based on the behavior of route overlapping - IEEE CIRCUITS AND SYSTEMS MAGAZINE FOURTH QUARTER 2019