Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

2018 ◽  
Vol 32 (05) ◽  
pp. 1850067 ◽  
Author(s):  
Michele Bellingeri ◽  
Zhe-Ming Lu ◽  
Davide Cassi ◽  
Francesco Scotognella
Keyword(s):  
Complex Network ◽  
Real World ◽  
Road Traffic ◽  
Network Efficiency ◽  
Weighted Network ◽  
Node Importance ◽  
Connected Cluster ◽  
Binary Network ◽  
Binary Networks ◽  
Weighted Rank

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

scholarly journals Characterizing dissimilarity of weighted networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yuanxiang Jiang ◽  
Meng Li ◽  
Ying Fan ◽  
Zengru Di
Keyword(s):  
Complex Network ◽  
Network Structure ◽  
Real World ◽  
Basic Problem ◽  
Experimental Results ◽  
Weighted Network ◽  
Weighted Networks ◽  
Comprehensive Information ◽  
Complementary Graph

AbstractMeasuring the dissimilarities between networks is a basic problem and wildly used in many fields. Based on method of the D-measure which is suggested for unweighted networks, we propose a quantitative dissimilarity metric of weighted network (WD-metric). Crucially, we construct a distance probability matrix of weighted network, which can capture the comprehensive information of weighted network. Moreover, we define the complementary graph and alpha centrality of weighted network. Correspondingly, several synthetic and real-world networks are used to verify the effectiveness of the WD-metric. Experimental results show that WD-metric can effectively capture the influence of weight on the network structure and quantitatively measure the dissimilarity of weighted networks. It can also be used as a criterion for backbone extraction algorithms of complex network.

A New Evaluation Method of Node Importance in Directed Weighted Complex Networks

2017 ◽  
Vol 5 (4) ◽  
pp. 367-375 ◽  
Author(s):  
Yu Wang ◽  
Jinli Guo ◽  
Han Liu
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Real World ◽  
Evaluation Method ◽  
Network Models ◽  
Node Importance ◽  
Weighted Complex Network ◽  
Complex Network Models ◽  
Evaluation Matrix ◽  
Key Nodes

AbstractCurrent researches on node importance evaluation mainly focus on undirected and unweighted networks, which fail to reflect the real world in a comprehensive and objective way. Based on directed weighted complex network models, the paper introduces the concept of in-weight intensity of nodes and thereby presents a new method to identify key nodes by using an importance evaluation matrix. The method not only considers the direction and weight of edges, but also takes into account the position importance of nodes and the importance contributions of adjacent nodes. Finally, the paper applies the algorithm to a microblog-forwarding network composed of 34 users, then compares the evaluation results with traditional methods. The experiment shows that the method proposed can effectively evaluate the node importance in directed weighted networks.

Research and Application of Importance Degree Evaluation Method of Complex Network Cascade Connection Node Based on Load Redistribution

2014 ◽  
Vol 998-999 ◽  
pp. 1174-1177
Author(s):  
Yun Peng Zhang
Keyword(s):  
Complex Network ◽  
Network Performance ◽  
Evaluation Method ◽  
Cascading Failure ◽  
Network Efficiency ◽  
Node Importance ◽  
Critical Nodes ◽  
Cascade Connection ◽  
The One ◽  
Definition Of

This paper presented a model with overload function for cascading failure. The main differences with respect to previous models are as follows: overload function is defined for each node, according to the value of overload function, one node has th ree states: success, overload, failure. After the load decreases, an overloaded node can be success again. The evolution of topology is replaced by the evolution of value of overload function during the process of cascading failure. It’s needless to delete the failure nodes and its edges, the load will avoid the failure nodes automat ically and the decrease of network performance will be reflected by network efficiency. An evaluation method of node importance considering cascading failure is proposed, and its algorithm is presented. A new definition of node importance is proposed. The most important node is the one who see failure results in the largest decrease of networks efficiency at the end of cascading. The evaluation method can help us to find some potential critical nodes which are sensitive to the efficiency of networks but not so important intuitively. Final example verifies its efficiency and feasibility.

scholarly journals Quantifying the Robustness of Complex Networks with Heterogeneous Nodes

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2769
Author(s):  
Prasan Ratnayake ◽  
Sugandima Weragoda ◽  
Janaka Wansapura ◽  
Dharshana Kasthurirathna ◽  
Mahendra Piraveenan
Keyword(s):  
Complex Network ◽  
Real World ◽  
Fitness Function ◽  
Co2 Exchange ◽  
Network Simulator ◽  
Network Efficiency ◽  
Scale Free ◽  
Robustness Measure ◽  
Heterogeneous Nodes ◽  
Exchange Network

The robustness of a complex network measures its ability to withstand random or targeted attacks. Most network robustness measures operate under the assumption that the nodes in a network are homogeneous and abstract. However, most real-world networks consist of nodes that are heterogeneous in nature. In this work, we propose a robustness measure called fitness-incorporated average network efficiency, that attempts to capture the heterogeneity of nodes using the `fitness’ of nodes in measuring the robustness of a network. Further, we adopt the same measure to compare the robustness of networks with heterogeneous nodes under varying topologies, such as the scale-free topology or the Erdős–Rényi random topology. We apply the proposed robustness measure using a wireless sensor network simulator to show that it can be effectively used to measure the robustness of a network using a topological approach. We also apply the proposed robustness measure to two real-world networks; namely the CO2 exchange network and an air traffic network. We conclude that with the proposed measure, not only the topological structure, but also the fitness function and the fitness distribution among nodes, should be considered in evaluating the robustness of a complex network.

scholarly journals LPA-MNI: An Improved Label Propagation Algorithm Based on Modularity and Node Importance for Community Detection

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 497
Author(s):  
Huan Li ◽  
Ruisheng Zhang ◽  
Zhili Zhao ◽  
Xin Liu
Keyword(s):  
Community Detection ◽  
Real World ◽  
Label Propagation ◽  
Node Importance ◽  
Propagation Algorithm ◽  
Synthetic Networks

Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation algorithm named LPA-MNI is proposed in this study by combining the modularity function and node importance with the original LPA. LPA-MNI first identify the initial communities according to the value of modularity. Subsequently, the label propagation is used to cluster the remaining nodes that have not been assigned to initial communities. Meanwhile, node importance is used to improve the node order of label updating and the mechanism of label selecting when multiple labels are contained by the maximum number of nodes. Extensive experiments are performed on twelve real-world networks and eight groups of synthetic networks, and the results show that LPA-MNI has better accuracy, higher modularity, and more reasonable community numbers when compared with other six algorithms. In addition, LPA-MNI is shown to be more robust than the traditional LPA algorithm.

scholarly journals Identifying Node Importance in a Complex Network Based on Node Bridging Feature

2018 ◽  
Vol 8 (10) ◽  
pp. 1914 ◽  
Author(s):  
Lincheng Jiang ◽  
Yumei Jing ◽  
Shengze Hu ◽  
Bin Ge ◽  
Weidong Xiao
Keyword(s):  
Complex Networks ◽  
Large Scale ◽  
Shortest Paths ◽  
Evaluation Criteria ◽  
Local Network ◽  
Network Efficiency ◽  
Network Attack ◽  
Node Importance ◽  
Pass Through ◽  
Large Scale Networks

Identifying node importance in complex networks is of great significance to improve the network damage resistance and robustness. In the era of big data, the size of the network is huge and the network structure tends to change dynamically over time. Due to the high complexity, the algorithm based on the global information of the network is not suitable for the analysis of large-scale networks. Taking into account the bridging feature of nodes in the local network, this paper proposes a simple and efficient ranking algorithm to identify node importance in complex networks. In the algorithm, if there are more numbers of node pairs whose shortest paths pass through the target node and there are less numbers of shortest paths in its neighborhood, the bridging function of the node between its neighborhood nodes is more obvious, and its ranking score is also higher. The algorithm takes only local information of the target nodes, thereby greatly improving the efficiency of the algorithm. Experiments performed on real and synthetic networks show that the proposed algorithm is more effective than benchmark algorithms on the evaluation criteria of the maximum connectivity coefficient and the decline rate of network efficiency, no matter in the static or dynamic attack manner. Especially in the initial stage of attack, the advantage is more obvious, which makes the proposed algorithm applicable in the background of limited network attack cost.

Efficient Crash Structure Design for Road Traffic Accidents of Tomorrow

2021 ◽  
Author(s):  
Jesper Christensen
Keyword(s):  
Specific Energy ◽  
Real World ◽  
Traffic Accidents ◽  
Road Traffic ◽  
Structure Design ◽  
Road Traffic Accidents ◽  
Reduced Order ◽  
Significant Potential ◽  
Reduced Order Modelling ◽  
Comprehensive Study

This is a comprehensive study exploring a number of innovativeapproaches to efficient crash structure design for automotive applications.The study is completed using a novel reduced order modelling approachenabling a detailed investigation that is not computationally prohibitive. The study includes a number of innovative designs with significant potential for dramatically increasing specific energy absorbance, but also highlights that some of these are more prone to a number of problematic aspects relating to real world implementation.

scholarly journals High-resolution mapping of vehicle emissions of atmospheric pollutants based on large-scale, real-world traffic datasets

2019 ◽  
Author(s):  
Daoyuan Yang ◽  
Shaojun Zhang ◽  
Tianlin Niu ◽  
Yunjie Wang ◽  
Honglei Xu ◽  
...  
Keyword(s):  
Urban Area ◽  
Real World ◽  
Vehicle Emissions ◽  
Large Scale ◽  
Emission Inventory ◽  
Road Traffic ◽  
Dispersion Model ◽  
Traffic Monitoring ◽  
Atmospheric Pollutants ◽  
Link Model

Abstract. On-road vehicle emissions are a major contributor to elevated air pollution levels in populous metropolitan areas. We developed a link-level emissions inventory of vehicular pollutants, called EMBEV-Link, based on multiple datasets extracted from the extensive road traffic monitoring network that covers the entire municipality of Beijing, China (16 400 km2). We employed the EMBEV-Link model under various traffic scenarios to capture the significant variability in vehicle emissions, temporally and spatially, due to the real-world traffic dynamics and the traffic restrictions implemented by the local government. The results revealed high carbon monoxide (CO) and total hydrocarbon (THC) emissions in the urban area (i.e., within the Fifth Ring Road) and during rush hours, both associated with the passenger vehicle traffic. By contrast, considerable fractions of nitrogen oxides (NOX), fine particulate matter (PM2.5) and black carbon (BC) emissions were present beyond the urban area, as heavy-duty trucks (HDTs) were not allowed to drive through the urban area during daytime. The EMBEV-Link model indicates that non-local HDTs could for 29 % and 38 % of estimated total on-road emissions of NOX and PM2.5, which were ignored in previous conventional emission inventories. We further combined the EMBEV-Link emission inventory and a computationally efficient dispersion model, RapidAir®, to simulate vehicular NOX concentrations at fine resolutions (10 m × 10 m in the entire municipality and 1 m × 1 m in the hotspots). The simulated results indicated a close agreement with ground observations and captured sharp concentration gradients from line sources to ambient areas. During the nighttime when the HDT traffic restrictions are lifted, HDTs could be responsible for approximately 10 μg m−3 of NOX in the urban area. The uncertainties of conventional top-down allocation methods, which were widely used to enhance the spatial resolution of vehicle emissions, are also discussed by comparison with the EMBEV-Link emission inventory.

scholarly journals A Method of Bus Network Optimization Based on Complex Network and Beidou Vehicle Location

2019 ◽  
Vol 11 (4) ◽  
pp. 97 ◽  
Author(s):  
Peixin Dong ◽  
Dongyuan Li ◽  
Jianping Xing ◽  
Haohui Duan ◽  
Yong Wu
Keyword(s):  
Graph Theory ◽  
Complex Network ◽  
Network Optimization ◽  
Original Network ◽  
Network Efficiency ◽  
Bus Stop ◽  
Time Performance ◽  
Network Time ◽  
Vehicle Location ◽  
Bus Stops

Aiming at the problems of poor time performance and accuracy in bus stops network optimization, this paper proposes an algorithm based on complex network and graph theory and Beidou Vehicle Location to measure the importance of bus stops. This method narrows the scope of points and edges to be optimized and is applied to the Jinan bus stop network. In this method, the bus driving efficiency, which can objectively reflect actual road conditions, is taken as the weight of the connecting edges in the network, and the network is optimized through the network efficiency. The experimental results show that, compared with the original network, the optimized network time performance is good and the optimized network bus driving efficiency is improved.

Sign in / Sign up

Export Citation Format

Share Document