Chapter

Temporal Analysis of a Bus Transit Network

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

Transit networks are essentially temporal with their topology evolving over time. While there are several studies on the topological properties of bus transit networks, none of them have captured the temporal network characteristics. We present a temporal analysis of a bus transit network using snapshot representation. We propose a supply-based weight measure, called the service utilization factor (SUF), and define it as the passenger demand per trip between two bus stops. We evaluate the complex network properties in three weighted cases for a bus network in India, using the number of overlapping routes, passenger demand between routes and SUF as weights. The study network is well-connected with 1.48 number of transfers on average to travel between any two stops over the day. The temporal analysis indicated an inadequate number of services in peak periods and route redundancy across the time periods. We identified the existing and potential hubs in the network, which were found to vary across time periods. The network has strongly connected communities that remain constant across the day. Our conclusions exemplify the importance of temporally analyzing transit networks for improving their efficiency.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
Aviation transportation systems have developed rapidly in recent years and have become a focus for research on the modeling of epidemics. However, despite the number of studies on aggregated topological structures and their effects on the spread of disease, the temporal sequence of flights that connect different airports have not been examined. In this study, to analyze the temporal pattern of the Chinese Aviation Network (CAN), we obtain a time series of topological statistics through sliding the temporal CAN with an hourly time window. In addition, we build two types of Susceptible-Infectious (SI) spreading models to study the effects of linking sequence and temporal duration on the spread of diseases. The results reveal that the absence of links formed by flights without alternatives at dawn and night causes a significant decrease in the centralization of the network. The temporal sparsity of linking sequence slows down the spread of disease on CAN, and the duration of flights intensifies the sensitiveness of CAN to targeted infection. The results are of great significance for further understanding of the aviation network and the dynamic process, such as the propagation of delay.
Article
Full-text available
Through the past decade the field of network science has established itself as a common ground for the cross-fertilization of exciting inter-disciplinary studies which has motivated researchers to model almost every physical system as an interacting network consisting of nodes and links. Although public transport networks such as airline and railway networks have been extensively studied, the status of bus networks still remains in obscurity. In developing countries like India, where bus networks play an important role in day-to-day commutation, it is of significant interest to analyze its topological structure and answer some of the basic questions on its evolution, growth, robustness and resiliency. In this paper, we model the bus networks of major Indian cities as graphs in \textit{L}-space, and evaluate their various statistical properties using concepts from network science. Our analysis reveals a wide spectrum of network topology with the common underlying feature of small-world property. We observe that the networks although, robust and resilient to random attacks are particularly degree-sensitive. Unlike real-world networks, like Internet, WWW and airline, which are virtual, bus networks are physically constrained. The presence of various geographical and economic constraints allow these networks to evolve over time. Our findings therefore, throw light on the evolution of such geographically and socio-economically constrained networks which will help us in designing more efficient networks in the future.
Conference Paper
Full-text available
Longitudinal networks evolve over time through the addition or deletion of nodes and edges. A longitudinal network can be viewed as a single static network that aggregates all edges observed over some time period (i.e., structure of network is fixed), or as a series of static networks observed in different point of time over the entire network observation period (i.e., structure of network is changing over time). By following a topological approach (i.e., static topology and dynamic topology), this paper first proposes a framework to analyze longitudinal networks. In static topology, SNA methods are applied to the aggregated network of entire observation period. Smaller segments of network data (i.e., short-interval network) that are accumulated in less time compared to the entire network observation period are used in dynamic topology for analysis purpose. Based on this framework, this study then conducts a topological analysis of email communication networks of an organization during its different operational conditions to explore changes in the behavior of actor-level dynamics.
Article
Full-text available
We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties resulting from the coexistence of a local structure and random long-range connections, and we examine their evolution with size and disorder strength. We show that any finite value of the disorder is able to trigger a "small-world" behaviour as soon as the initial lattice is big enough, and study the crossover between a regular lattice and a "small-world" one. These results are corroborated by the investigation of an Ising model defined on the network, showing for every finite disorder fraction a crossover from a high-temperature region dominated by the underlying one-dimensional structure to a mean-field like low-temperature region. In particular there exists a finite-temperature ferromagnetic phase transition as soon as the disorder strength is finite. [0.5cm]
Article
Full-text available
The study of influential members of human networks is an important research question in social network analysis. However, the current state-of-the-art is based on static or aggregated representation of the network topology. We argue that dynamically evolving network topologies are inherent in many systems, including real online social and technological networks: fortunately the nature of these systems is such that they allow the gathering of large quantities of finegrained temporal data on interactions amongst the network members. In this paper we propose novel temporal centrality metrics which take into account such dynamic interactions over time. Using a real corporate email dataset we evaluate the important individuals selected by means of static and temporal analysis taking two perspectives: firstly, from a semantic level, we investigate their corporate role in the organisation; and secondly, from a dynamic process point of view, we measure information dissemination and the role of information mediators. We find that temporal analysis provides a better understanding of dynamic processes and a more accurate identification of important people compared to traditional static methods.
Article
Full-text available
Recently, we have presented the first exhaustive analysis of the world-wide airport network. Two important results of that study are that: (i) the world-wide airport network is a small-world network with power-law decaying degree and betweenness centrality distributions; (ii) the most connected cities (largest degree) are typically not the most central cities (largest betweenness centrality). This second finding is particularly significant because of results demonstrating that nodes with high betweenness tend to play a more important role in keeping networks connected than those with high degree. Here, we investigate if current network models can explain this finding and we show that they cannot. Thus, we propose a new model that explains this behavior in terms of the geo-political constraints that affect the growth of the airport network. We further hypothesize that in other infrastructures, affected by similar geo-political constraints, critical locations might not coincide with highly-connected hubs.
Chapter
Full-text available
We develop a new approach to the study of the dynamics of link utilization in complex networks using data of empirical social networks. Counter to the perspective that nodes have particular roles, we find roles change dramatically from day to day. “Local hubs” have a power law degree distribution over time, with no characteristic degree value. We further study the dynamics of local motif structure in time-dependent networks, and find recurrent patterns that might provide empirical evidence for cycles of social interaction. Our results imply a significant reinterpretation of the concept of node centrality and network local structure in complex networks, and among other conclusions suggest that interventions targeting hubs will have significantly less effect than previously thought.
Article
Full-text available
The mathematical study of the small-world concept has fostered quite some interest, showing that small-world features can be identified for some abstract classes of networks. However, passing to real complex systems, as for instance transportation networks, shows a number of new problems that make current analysis impossible. In this paper we show how a more refined kind of analysis, relying on transportation efficiency, can in fact be used to overcome such problems, and to give precious insights on the general characteristics of real transportation networks, eventually providing a picture where the small-world comes back as underlying construction principle.
Article
Full-text available
Structural properties of the Indian railway network is studied in the light of recent investigations of the scaling properties of different complex networks. Stations are considered as ``nodes'' and an arbitrary pair of stations is said to be connected by a ``link'' when at least one train stops at both stations. Rigorous analysis of the existing data shows that the Indian railway network displays small-world properties. We define and estimate several other quantities associated with this network.
Article
Full-text available
Through the study of airport network of China (ANC), composed of 128 airports (nodes) and 1165 flights (edges), we show the topological structure of ANC conveys two characteristics of small worlds, a short average path length (2.067) and a high degree of clustering (0.733). The cumulative degree distributions of both directed and undirected ANC obey two-regime power laws with different exponents, i.e., the so-called double Pareto law. In-degrees and out-degrees of each airport have positive correlations, whereas the undirected degrees of adjacent airports have significant linear anticorrelations. It is demonstrated both weekly and daily cumulative distributions of flight weights (frequencies) of ANC have power-law tails. Besides, the weight of any given flight is proportional to the degrees of both airports at the two ends of that flight. It is also shown the diameter of each subcluster (consisting of an airport and all those airports to which it is linked) is inversely proportional to its density of connectivity. Efficiency of ANC and of its subclusters is measured through a simple definition. In terms of that, the efficiency of ANC's subclusters increases as the density of connectivity does. ANC is found to have an efficiency of 0.484.
Article
Full-text available
The knowledge of real-life traffic patterns is crucial for a good understanding and analysis of transportation systems. These data are quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traffic flows from timetables of public mass transportation systems. We apply this algorithm to timetables of three large transportation networks. This enables us to make a systematic comparison between three different approaches to construct a graph representation of a transportation network; the resulting graphs are fundamentally different. We also find that the real-life traffic pattern is very heterogenous, in both space and traffic flow intensities, which makes it very difficult to approximate the node load with a number of topological estimators.
Article
Full-text available
We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks.
Article
We present a complex weighted network analysis of a bus transport network. We model the network as graphs in L-space and P-space and evaluate the statistical properties in unweighted and weighted cases. The weights considered include number of overlapping routes and passenger demand between two bus stops. We also introduce a new supply-based edge weight called Service Utilization Factor (SUF) and define it as the passenger demand per service between two stops. We extract the origin and destination of the passenger trips from bus ticket information. In the bus system under study, the tickets are issued between’stages’ instead of between bus stops. We propose a points of interest based procedure to map the passenger demand between stages to between bus stops. The network has scale-free behavior with preferential attachment of nodes and is similar to small-world networks. It is well-connected with an average of 1.4 transfers required to travel between any two points in the network. We identify redundant routes in the network from strength values in the SUF weighted networks. Disassortativity in the demand weighted network indicated that bus stops with higher attractiveness are not necessarily situated contiguously along a route. The SUF weighted network is assortative indicating presence of well-serviced stops along the same the route. We identified the stops with higher betweenness centrality, that can be ideal candidates for being developed as hubs. Our conclusions exemplify the importance of considering route overlaps, passenger demand and service utilization in bus network analysis and for building an efficient bus network.
Article
The structure and properties of public transportation networks have great implications for urban planning, public policies and infectious disease control. We contribute a complex weighted network analysis of travel routes on the Singapore rail and bus transportation systems. We study the two networks using both topological and dynamical analyses. Our results provide additional evidence that a dynamical study adds to the information gained by traditional topological analysis, providing a richer view of complex weighted networks. For example, while initial topological measures showed that the rail network is almost fully connected, dynamical measures highlighted hub nodes that experience disproportionately large traffic. The dynamical assortativity of the bus networks also differed from its topological counterpart. In addition, inspection of the weighted eigenvector centralities highlighted a significant difference in traffic flows for both networks during weekdays and weekends, suggesting the importance of adding a temporal perspective missing from many previous studies.
Article
We report the statistical properties of three bus-transport networks (BTN) in three different cities of China. These networks are composed of a set of bus lines and stations serviced by these. Network properties, including the degree distribution, clustering and average path length are studied in different definitions of network topology. We explore scaling laws and correlations that may govern intrinsic features of such networks. Besides, we create a weighted network representation for BTN with lines mapped to nodes and number of common stations to weights between lines. In such a representation, the distributions of degree, strength and weight are investigated. A linear behavior between strength and degree s(k)∼k is also observed.
Article
The clustering coefficient, path length and average vertex degree of two urban train line networks have been calculated. The results are compared with theoretical predictions for appropriate random bipartite graphs. They have also been compared with one another to investigate the effect of architecture on the small-world properties.
Article
In this paper, we present the empirical investigation results on the urban bus transport networks (BTNs) of four major cities in China. In BTN, nodes are bus stops. Two nodes are connected by an edge when the stops are serviced by a common bus route. The empirical results show that the degree distributions of BTNs take exponential function forms. Other two statistical properties of BTNs are also considered, and they are suggested as the distributions of so-called “the number of stops in a bus route” (represented by S) and “the number of bus routes a stop joins” (by R). The distributions of R also show exponential function forms, while the distributions of S follow asymmetric, unimodal functions. To explain these empirical results and attempt to simulate a possible evolution process of BTN, we introduce a model by which the analytic and numerical result obtained agrees well with the empirical facts. Finally, we also discuss some other possible evolution cases, where the degree distribution shows a power law or an interpolation between the power law and the exponential decay.
Article
Transportation infrastructure of a country is one of the most important indicators of its economic growth. Here we study the Airport Network of India (ANI) which represents India’s domestic civil aviation infrastructure as a complex network. We find that ANI, a network of domestic airports connected by air links, is a small-world network characterized by a truncated power-law degree distribution and has a signature of hierarchy. We investigate ANI as a weighted network to explore its various properties and compare them with their topological counterparts. The traffic in ANI, as in the World-wide Airport Network (WAN), is found to be accumulated on interconnected groups of airports and is concentrated between large airports. In contrast to WAN, ANI is found to be having disassortative mixing which is offset by the traffic dynamics. The analysis indicates possible mechanism of formation of a national transportation network, which is different from that on a global scale.