scholarly journals Analysis of scale-free characteristic on sharp variation point of traffic flow

2014 ◽  
Vol 63 (24) ◽  
pp. 240509
Author(s):  
Zhang Yong ◽  
Li Shi-Gao
Keyword(s):  
Traffic Flow ◽  
Scale Free ◽  
Sharp Variation ◽  
Variation Point

Dynamic urban traffic flow behavior on scale-free networks

2008 ◽  
Vol 387 (2-3) ◽  
pp. 653-660 ◽  
Author(s):  
J.J. Wu ◽  
H.J. Sun ◽  
Z.Y. Gao
Keyword(s):  
Traffic Flow ◽  
Flow Behavior ◽  
Urban Traffic ◽  
Scale Free ◽  
Scale Free Networks

CAPACITY ASSIGNMENT MODEL TO DEFENSE CASCADING FAILURES

2009 ◽  
Vol 20 (07) ◽  
pp. 991-999 ◽  
Author(s):  
J. J. WU ◽  
H. J. SUN ◽  
Z. Y. GAO
Keyword(s):  
Traffic Flow ◽  
Cascading Failures ◽  
Traffic Networks ◽  
Practical Application ◽  
Assignment Rule ◽  
Scale Free ◽  
Capacity Assignment ◽  
Assignment Model ◽  
Equilibrium Assignment ◽  
Theoretical Significance

How to alleviate the damages of cascading failures triggered by the overload of edges/nodes is common in complex networks. To describe the whole cascading failures process from edges overloading to nodes malfunctioning and the dynamic spanning clustering with the evolvement of traffic flow, we propose a capacity assignment model by introducing an equilibrium assignment rule of flow in artificially created scale-free traffic networks. Additionally, the capacity update rule of node is given in this paper. We show that a single failed edge may undergo the cascading failures of nodes, and a small failure has the potential to trigger a global cascade. It is suggested that enhancing the capacity of node is particularly important for the design of any complex network to defense the cascading failures. Meanwhile, it has very important theoretical significance and practical application worthiness in the development of effective methods to alleviate the damage of one or some failed edges/nodes.

scholarly journals SCALE-FREE NETWORK THEORY IN STUDYING THE STRUCTURE OF THE ROAD NETWORK IN POLAND

2014 ◽  
Vol 26 (3) ◽  
pp. 235-242 ◽  
Author(s):  
Katarzyna KOCUR-BERA
Keyword(s):  
Statistical Analysis ◽  
Traffic Flow ◽  
Network Theory ◽  
Road Network ◽  
Scale Free Network ◽  
Scale Free ◽  
The Road ◽  
Normal Character ◽  
Free Network ◽  
The Relationship

This paper discusses the issue of statistical analysis of traffic flow in different regions of Poland. Such analysis allows us to identify “valuable (sensitive) areas” whose damage or blockage may provoke considerable disturbances or even a stoppage of traffic flow in the examined road network. The results of the studies indicate that the road network in Poland has the properties of a scale-free network. The distribution of the examined variables does not have a normal character, whereas the relationship between the number of nodes and the number of connections is a power-law feature. 

A WEIGHTED NETWORK EVOLUTION WITH TRAFFIC FLOW UNDER PREFERENTIAL ATTACHMENT

2013 ◽  
Vol 24 (04) ◽  
pp. 1350020 ◽  
Author(s):  
MEIFENG DAI ◽  
RONGRONG LU
Keyword(s):  
Traffic Flow ◽  
Network Model ◽  
Traditional Method ◽  
Preferential Attachment ◽  
Transportation System ◽  
Network Evolution ◽  
Random Component ◽  
Weighted Network ◽  
Scale Free ◽  
Weighted Networks

With more attentions drawn to transportation, we find that it is available to analyze transportation system by using weighted networks. Distinguishing from traditional method, we introduce a dynamic weighted network model with evolutional size and weight. Additionally, the expected strength allocation vector of the model consists of a deterministic component reflecting preferential attachment and a random component, which can characterize the realistic network better. In this paper, we obtain the degree and strength distributions of the weighted network and we conclude that the network has scale-free characteristics.

Phase transition in evolution of traffic flow with scale-free property

2008 ◽  
Vol 17 (9) ◽  
pp. 3284-3288 ◽  
Author(s):  
Shen Bo ◽  
Gao Zi-You
Keyword(s):  
Phase Transition ◽  
Traffic Flow ◽  
Scale Free

Evolution of Traffic Flow with Scale-Free Topology

2005 ◽  
Vol 22 (10) ◽  
pp. 2711-2714 ◽  
Author(s):  
Gao Zi-You ◽  
Li Ke-Ping
Keyword(s):  
Traffic Flow ◽  
Scale Free

NETWORK ANALYSIS OF THE EVOLUTION OF TRAFFIC FLOW WITH SPEED INFORMATION

2010 ◽  
Vol 21 (02) ◽  
pp. 177-188 ◽  
Author(s):  
XIN-GANG LI ◽  
ZI-YOU GAO ◽  
JIAN-FENG ZHENG ◽  
BIN JIA
Keyword(s):  
Traffic Flow ◽  
Flow Model ◽  
Discrete Dynamical System ◽  
Strength Distribution ◽  
Evolution Process ◽  
Scale Free ◽  
Traffic State ◽  
Stop And Go ◽  
Free Behavior ◽  
High Degree

In the cellular automata traffic flow model, the traffic state can be represented by the discrete speed value of vehicles, thus the traffic flow can be deemed as a discrete dynamical system. In the evolution process of traffic flow, complex networks are constructed by representing the traffic state as node and the evolution relationship in timescale as link. The emerging times of link is defined as its weight, then the node strength is equal to the emerging times of the corresponding traffic state. As a result, a weighted network is obtained. The dynamics of stop-and-go traffic are studied by investigating the statistical properties of the network. Simulation results show that scale-free behavior commonly exists in the evolution process of stop-and-go traffic. The degree distribution, node strength distribution and link weight distribution have the power law form. The node with high degree also has large strength. The structure of the network is not influenced by the randomization probability and density as long as the stop-and-go traffic is reproduced.

Traffic Flow in Scale-Free Hierarchical Directed Networks

2020 ◽  
Vol 89 (4) ◽  
pp. 043002
Author(s):  
Takashi Nagatani ◽  
Genki Ichinose
Keyword(s):  
Traffic Flow ◽  
Directed Networks ◽  
Scale Free

scholarly journals Dynamical patterns of epidemic outbreaks on scale-free networks with traffic flow

2012 ◽  
Vol 61 (20) ◽  
pp. 200209
Author(s):  
Hu Heng-Kai ◽  
Wang Kai ◽  
Yang Guang ◽  
Liu Qian ◽  
Pei Wen-Jiang ◽  
...  
Keyword(s):  
Traffic Flow ◽  
Scale Free ◽  
Scale Free Networks ◽  
Dynamical Patterns

scholarly journals TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION

2007 ◽  
Vol 17 (07) ◽  
pp. 2363-2385 ◽  
Author(s):  
BOSILJKA TADIĆ ◽  
G. J. RODGERS ◽  
STEFAN THURNER
Keyword(s):  
Traffic Flow ◽  
Traffic Congestion ◽  
Numerical Models ◽  
Traffic Noise ◽  
Transport Processes ◽  
Scale Free ◽  
Underlying Network ◽  
Network Topologies ◽  
Free Network

Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper, we address this question by using numerical models in which both structure and dynamics are controlled systematically. We consider the traffic of information packets that include driving, searching and queuing. We present the results of extensive simulations on two classes of networks; a correlated cyclic scale-free network and an uncorrelated homogeneous weakly clustered network. By measuring different dynamical variables in the free flow regime we show how the global statistical properties of the transport are related to the temporal fluctuations at individual nodes (the traffic noise) and the links (the traffic flow). We then demonstrate that these two network classes appear as representative topologies for optimal traffic flow in the regimes of low density and high density traffic, respectively. We also determine statistical indicators of the pre-jamming regime on different network geometries and discuss the role of queuing and dynamical betweenness for the traffic congestion. The transition to the jammed traffic regime at a critical posting rate on different network topologies is studied as a phase transition with an appropriate order parameter. We also address several open theoretical problems related to the network dynamics.

Sign in / Sign up

Export Citation Format

Share Document