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 network perspective on the calamity, induced inaccessibility of communities and the robustness of centralized, landbound relief efforts

2014 ◽  
Vol 25 (06) ◽  
pp. 1450047 ◽  
Author(s):  
Jesus Felix Valenzuela ◽  
Erika Fille Legara ◽  
Xiuju Fu ◽  
Rick Siow Mong Goh ◽  
Robert De Souza ◽  
...  
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Scale Free Network ◽  
Scale Free ◽  
The Road ◽  
Disaster Relief Operations ◽  
Free Network ◽  
Relief Operations ◽  
Disaster Event ◽  
Relief Efforts

We examine the robustness of centralized, landbound relief operations' capability to promptly reach areas affected by a disaster event from a network perspective. We initially look at two idealized road networks: a two-dimensional grid and a scale-free network, and compare them to an actual road network obtained from OpenStreetMap. We show that, from a node designated as the center for relief operations (a "relief center"), damage to a road network causes a substantial fraction of the other nodes (about 20% in the three networks we examined) to become initially inaccessible from any relief effort, although the remaining majority can still be reached readily. Furthermore, we show the presence of a threshold in the two idealized road networks but not in the real one. Below this threshold, all nodes can robustly be reached in a short span of time, and above it, not only the partitioning mentioned above sets in, but also the time needed to reach the nodes becomes susceptible to the amount of damage sustained by the road network. Under damage sustained by random segments of the network, this threshold is higher in the scale-free network compared to the grid, due to the robustness of the former against random attacks. Our results may be of importance in formulating contingency plans for the logistics of disaster relief operations.

Design of the Small World Model by NS2

2014 ◽  
Vol 496-500 ◽  
pp. 2338-2341
Author(s):  
Jun Shang ◽  
Hao Qiang Liu ◽  
Qiang Liu ◽  
Zi Qi Liu
Keyword(s):  
Complex Network ◽  
Network Theory ◽  
Applied Research ◽  
Lower Cost ◽  
Small World ◽  
Scale Free Network ◽  
World Model ◽  
Complex Network Theory ◽  
Scale Free ◽  
Free Network

WSN is the network which is used mostly in the world nowadays, and it has the characteristics that lower cost and better functions than other kinds of the network, and the WSN network is built by the ordinary nodes and the super nodes.Theoretical study of the complex network is widely involved in the fields of computer networks, and the applied research becomes more and more important in the future. It has caused many academic attention about how to apply the complex network theory among the specific application in recent years. In the complex network theory, there has been a number of important research results about the use of the small-world network, scale-free network in the field of transportation.

scholarly journals Quantitative Controllability Index of Complex Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Lifu Wang ◽  
Yali Zhang ◽  
Jingxiao Han ◽  
Zhi Kong
Keyword(s):  
Complex Networks ◽  
Condition Number ◽  
Random Network ◽  
Small World ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
The Relationship ◽  
Controllability Index

In this paper, the controllability issue of complex network is discussed. A new quantitative index using knowledge of control centrality and condition number is constructed to measure the controllability of given networks. For complex networks with different controllable subspace dimensions, their controllability is mainly determined by the control centrality factor. For the complex networks that have the equal controllable subspace dimension, their different controllability is mostly determined by the condition number of subnetworks’ controllability matrix. Then the effect of this index is analyzed based on simulations on various types of network topologies, such as ER random network, WS small-world network, and BA scale-free network. The results show that the presented index could reflect the holistic controllability of complex networks. Such an endeavour could help us better understand the relationship between controllability and network topology.

CONSENSUS PROBLEMS IN SCALE-FREE NETWORK

2008 ◽  
Vol 22 (04) ◽  
pp. 435-445 ◽  
Author(s):  
ZHENGPING WU ◽  
ZHI-HONG GUAN
Keyword(s):  
Nearest Neighbor ◽  
Network Size ◽  
Average Degree ◽  
Consensus Problem ◽  
Scale Free Network ◽  
Scale Free ◽  
Free Network ◽  
Heterogeneity Parameter ◽  
Edge Failure ◽  
The Relationship

Recent advances in complex network research have stimulated increasing interest in understanding the relationship between the topology and dynamics of complex networks. In this paper, we investigate the consensus problem in a class of scale-free network with a heterogeneity parameter. It is found that, for a scale-free network, the time to reach a consensus is hundreds of times shorter than that of the nearest-neighbor coupled network with the same average degree and network size, and its robustness to the node-failure and edge-failure is increased at the same time. Furthermore, as the scale-free network becomes more homogenous, or its average degree becomes larger, the time to reach a consensus will become shorter, but not notably shorter. Therefore, the scale-free network with a larger exponent r and average degree k is a better choice to obtain a faster convergence speed in the consensus problem.

scholarly journals Identification of common points in hybrid geodetic networks to determine vertical movements of the Earth’s crust

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Kamil Kowalczyk ◽  
Anna Maria Kowalczyk ◽  
Jacek Rapiński
Keyword(s):  
Network Theory ◽  
Hybrid Networks ◽  
Hybrid Network ◽  
Scale Free Network ◽  
Regional Network ◽  
Vertical Movements ◽  
Scale Free ◽  
Use Of Data ◽  
Free Network ◽  
Gnss Observations

Abstract Simultaneous use of data repeated levelling measurements and continuous GNSS observations allows increasing the spatial resolution of geodynamics models. For this purpose, it is necessary to create a single network, a so-called hybrid network. This paper aims at examining the possibility of using scale-free network theory to determine the most relevant common points in hybrid networks using the distance criterion. Used on European network points: UELN (United European Levelling Network) and EPN (European Permanent GPS Network) and the regional network. In the hybrid network (UELN + EPN), 18 pseudo-nodal points with the highest number of links were identified. The accepted distance criterion shows that about 90 % of the EPN points can be used as common points. The application of the scale-free network theory allows determining the significance of points in a hybrid network.

scholarly journals Study on connectivity mechanism and robustness of three-dimensional pore network of sandstone based on complex network theory

2017 ◽  
Author(s):  
Guannan Liu ◽  
Xiaopeng Pei ◽  
Feng Gao ◽  
Xin Liang ◽  
Jianguo Wang ◽  
...  
Keyword(s):  
Complex Network ◽  
Network Theory ◽  
Structural Characteristics ◽  
Dominant Role ◽  
Three Dimensional ◽  
Scale Free Network ◽  
Complex Network Theory ◽  
Scale Free ◽  
Free Network ◽  
And Migration

Abstract. There are a large number of pores and throats inside the rock, with different magnitude and shape, whose connection is complex[1–3]. Based on the complex network theory, combined with X–ray CT scan and image processing technology, we used sandstone as an example to study the structural characteristics of rock network of different porosities. The experimental results show that the seepage network of sandstone is similar to the BA scale-free network in the structural characteristics. The average path length of sandstone generally increases with the increase of network magnitude. The average of number of edges of node plays a dominant role for the porosity of sandstone. It is inferred that in the large number of pores, few pores with a number of connections have an important role in the overall connectivity of the sandstone seepage network. At the same time, sandstone seepage network has better fault tolerance rate and robustness to external random attacks. The results of this paper may provide a new idea for the study of fluid storage and migration mechanisms in porous materials and the application of complex network theory in interdisciplinary fields.

A New Energy-Efficient and Fault-Tolerant Evolution Model for Large-Scale Wireless Sensor Networks Based on Complex Network Theory

2019 ◽  
Vol 10 (3) ◽  
pp. 21-36 ◽  
Author(s):  
Xiaobo Tan ◽  
Ji Tang ◽  
Liting Yu ◽  
Jialu Wang
Keyword(s):  
Network Theory ◽  
Energy Efficient ◽  
Large Scale ◽  
Fault Tolerant ◽  
Evolution Model ◽  
Scale Free Network ◽  
Complex Network Theory ◽  
Network Characteristics ◽  
Scale Free ◽  
Free Network

In this article, the authors present a new novel energy-efficient and fault-tolerant evolution model for large-scale wireless sensor networks based on complex network theory. In the evolution model, not only is the residual energy of each node considered, but also the constraint of links is introduced, which makes the energy consumption of the whole network more balanced. Furthermore, both preferential attachment and random attachment to the evolution model are introduced, which reduces the proportion of the nodes with high degree while keeping scale-free network characteristics to some extent. Theoretical analysis shows that the new model is an extension of the BA model, which is a mixed model between a BA model and a stochastic model. Simulation results show that EFEM has better stochastic network characteristics while keeping scale-free network characteristics if the value of random probability is near 0.2 and it can help to construct a high survivability network for large-scale WSNs.

Sign in / Sign up

Export Citation Format

Share Document