scholarly journals Urban Transit Network Properties Evaluation and Optimization Based on Complex Network Theory

2019 ◽  
Vol 11 (7) ◽  
pp. 2007 ◽  
Author(s):  
Guo-Ling Jia ◽  
Rong-Guo Ma ◽  
Zhi-Hua Hu
Keyword(s):  
Complex Network ◽  
Network Theory ◽  
Public Transportation ◽  
Path Length ◽  
Transportation Network ◽  
Average Path Length ◽  
Theory And Practice ◽  
Complex Network Theory ◽  
Public Transportation Network ◽  
Bus Network

Urban public transportation contributes greatly to sustainable urban development. An urban public transportation network is a complex system. It is meaningful for theory and practice to analyze the topological structure of an urban public transportation network and explore the spatial structure of an urban transportation network so as to mitigate and prevent traffic congestion and achieve sustainability. By examining the Xi’an bus network, the degree distribution, average path length, aggregation coefficient, and betweenness centrality of the bus station network were computed using models in complex network theory. The results show that the node degrees of the Xi’an bus network are unevenly distributed and present a polarization diagram with long average path length and high aggregation. A model based on betweenness and its solution method was developed to improve the public transportation network’s sustainability and discuss the possibility of optimizing the sustainability by network analyzing methods.

Complexity Analysis of Public Transportation Network in Zhangjiagang City Using Complex Network Theory

2012 ◽  
Vol 546-547 ◽  
pp. 1211-1216
Author(s):  
Yong Wang ◽  
Ta Zhou
Keyword(s):  
Complex Network ◽  
Public Transportation ◽  
Path Length ◽  
Complexity Analysis ◽  
Transportation Network ◽  
Average Path Length ◽  
Clustering Coefficient ◽  
Power Law Distribution ◽  
Complex Network Theory ◽  
Public Transportation Network

Public transportation network has been proven that it can be simulated as a complex network. In this paper, a bus transport system of Zhangjiagang city is considered. Network degree distribution, average path length, and clustering coefficient are utilized as criteria to analyze as the complexity of the network. Experimental results show that the network which is in line with power-law distribution has a smaller average path length and a large clustering coefficient. It also indicates that, the networks of Zhangjiagang public bus system are not a small-world network with scale-free property.

scholarly journals A Novel Algorithm of Identification Theory of Complex Network for Public Transportation Network Cascading Failure

2021 ◽  
Vol 15 ◽  
pp. 236-247
Author(s):  
Xu Xu
Keyword(s):  
Complex Network ◽  
Network Theory ◽  
Public Transportation ◽  
Transportation Network ◽  
Network Evolution ◽  
Cascading Failure ◽  
Complex Network Theory ◽  
Node Importance ◽  
Public Transportation Network ◽  
Bus Network

With the development of complex network theory and the gradual application of the traffic field, the problem of cascading failure has caused great attention of researchers. This paper tries to propose a new method based on complex network theory to measure the importance of nodes in the network. Based on complex network theory, this paper first discusses the network evolution mechanism of three main contents, define the importance of nodes in the network, and the design of the network center and the evaluation of the importance of node algorithm. In the end, a critical section identification method considering the failure probability and the failure consequence is designed, and the method for calculating the node importance based on the cascading failure is proposed. Using complex network theory, a quantitative assessment of the center of public transportation network and node importance model is designed. The bus network center, for the study of node importance analysis of bus network survivability has important significance. Help guide the optimization of public transport network service. Improve transport capacity of public transportation system.

Research on the Structure of Peer-to-Peer Overlay Based on the Complex Network Theory

2012 ◽  
Vol 263-266 ◽  
pp. 1096-1099
Author(s):  
Zhi Yong Jiang
Keyword(s):  
Complex Network ◽  
Network Theory ◽  
Degree Distribution ◽  
Path Length ◽  
Small World ◽  
Peer To Peer ◽  
Clustering Coefficient ◽  
Power Law Distribution ◽  
Complex Network Theory ◽  
The Mean

Relationship between nodes in peer-to-peer overlay, currently becomes a hot topic in the field of complex network. In this paper a model of peer-to-peer overlay was purposed. And then the paper focused on figuring out the mean-shortest path length (MSPL), clustering coefficient (CC) and the degree of every node which allowed us to discover the degree distribution. The results show that the degree distribution function follows approximately power law distribution and the network possesses notable clustering and small-world properties.

scholarly journals Complex Network Theory for Water Distribution Networks Analysis

10.29007/w1bk ◽  
2018 ◽  
Author(s):  
Antonietta Simone ◽  
Luca Ridolfi ◽  
Luigi Berardi ◽  
Daniele Laucelli ◽  
Orazio Giustolisi
Keyword(s):  
Complex Network ◽  
Network Theory ◽  
Path Length ◽  
Water Distribution ◽  
Distribution Networks ◽  
Networked Systems ◽  
Clustering Coefficient ◽  
Complex Network Theory ◽  
Connectivity Structure

Performance of networked systems greatly depends on their topologic or connectivity structure. Nowadays, the analysis of the relevant features influencing the emerging behavior of networked systems is possible because of the increasing computational power and availability of information. Complex Network Theory classifies the connectivity structures of real systems using the nodal degree, the average path length, the clustering coefficient and the probability of connection. However, networked city infrastructures, e.g. water distribution networks (WDNs), are constrained by the spatial characteristics of the environment where they are laid. Therefore, networked infrastructures are classified as spatial networks and the classification of their connectivity structure requires a modification of the classic framework. To this purpose, the paper proposes a classification of WDNs using the neighbourhood nodal degree instead of the classic degree, the network size instead of the probability of connection and the classic average path length. The research will show that the clustering coefficient is not useful to describe the behavior of these constrained systems.

scholarly journals Structural Analysis of Bus Networks Using Indicators of Graph Theory and Complex Network Theory

2017 ◽  
Vol 11 (1) ◽  
pp. 92-100 ◽  
Author(s):  
Hui Zhang
Keyword(s):  
Graph Theory ◽  
Complex Network ◽  
Adjacency Matrix ◽  
Network Theory ◽  
Weighted Average ◽  
Power Law Distribution ◽  
Complex Network Theory ◽  
Path Distance ◽  
Bus Network ◽  
Bus Networks

The structure of bus network is very significant for bus system. To evaluate the performance of the structure of bus network, indicators basing on graph theory and complex network theory are proposed. Three forms of matrices comprising line-station matrix, weighted adjacency matrix and adjacency matrix under space P are used to represent the bus network. The paper proposes a shift power law distribution which is related average degree of network to fit the degree distribution and a method to calculate the average transfer time between any two stations using adjacency matrix under P space. Moreover, this paper proposes weighted average shortest path distance and transfer efficiency to evaluate the bus network. The results show that the indicators that we introduce, effectively reflect properties of bus network.

scholarly journals Using Network Theory to Explore BIM Application Barriers for BIM Sustainable Development in China

2020 ◽  
Vol 12 (8) ◽  
pp. 3190
Author(s):  
Yongliang Deng ◽  
Jinyun Li ◽  
Qiuting Wu ◽  
Shuangshuang Pei ◽  
Na Xu ◽  
...  
Keyword(s):  
Sustainable Development ◽  
Network Theory ◽  
Path Length ◽  
Small World ◽  
Average Path Length ◽  
Clustering Coefficient ◽  
Information Modeling ◽  
Power Law Distribution ◽  
Complex Network Theory ◽  
Scale Free

Building Information Modeling (BIM) technology has promoted the development of the architecture, engineering, and construction (AEC) industry, but has encountered many barriers to its application in China. Therefore, identifying the barriers to BIM application and capturing their interactions are essential in order to control and eliminate the determined barriers. From this standpoint, 23 BIM application barriers were identified through a literature review and expert interviews. Furthermore, the interactions among them were determined based on the Delphi method, which was the foundation for establishing the BIM application barrier network (BABN). Then, the software Pajek was employed to construct the network model and reveal its topological characteristics based on complex network theory, including degree, betweenness, eigenvector, clustering coefficient, network diameter, and average path length. As indicated by the results, BABN possesses scale-free network property because its cumulative degree distribution obeys power–law distribution. BABN is also a small-world network, due to its relatively high clustering coefficient as well as small average path length, implying that barrier propagation in BABN is fast. In addition, the results are discussed and recommendations are proposed. This research will help BIM stakeholders to develop coping strategies to control and eliminate BIM application barriers for the sake of driving BIM sustainable development.

Sign in / Sign up

Export Citation Format

Share Document