Pinning Control of Enterprise Marketing Network Based on Complex Network Theory

2014 ◽  
Vol 533 ◽  
pp. 491-494
Author(s):  
Xiao Hong Qin ◽  
Wei Ge
Keyword(s):  
Network Topology ◽  
Control Strategy ◽  
Network Theory ◽  
Large Scale ◽  
Pinning Control ◽  
Scale Free Network ◽  
Complex Network Theory ◽  
Scale Free ◽  
Free Network ◽  
Marketing Network

Complex enterprise marketing network is typical scale-free network. Based on the non-uniformity of enterprise marketing network topology, we select pinning control strategy. There are network members for selection a certain percentage to exercise control, to use of virtual control action associated with the coupling between network members, making large-scale enterprise marketing network reaches a steady state. Paper showed that pinning control is effectiveness to control of enterprise marketing for network.

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.

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 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.

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. 

Modeling and Simulation for Complex Network Based Military System-of-Systems (SoS)

2011 ◽  
Vol 145 ◽  
pp. 224-228 ◽  
Author(s):  
Xiao Song ◽  
Bing Cheng Liu ◽  
Guang Hong Gong
Keyword(s):  
Modeling And Simulation ◽  
Complex Network ◽  
Network Topology ◽  
Network Theory ◽  
Small World ◽  
System Of Systems ◽  
Statistical Parameters ◽  
Complex Network Theory ◽  
Scale Free ◽  
Topology Model

Military SoS increasingly shows its relation of complex network. According to complex network theory, we construct a SoS network topology model for network warfare simulation. Analyzing statistical parameters of the model, it is concluded that the topology model has small-world, high-aggregation and scale-free properties. Based on this model we mainly simulate and analyze vulnerability of the network. And this provides basis for analysis of the robustness and vulnerability of real battle SoS network.

scholarly journals The Analysis of the Properties of Bus Network Topology in Beijing Basing on Complex Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Hui Zhang ◽  
Peng Zhao ◽  
Jian Gao ◽  
Xiang-ming Yao
Keyword(s):  
Network Topology ◽  
Second Phase ◽  
Scale Free Network ◽  
Approach Space ◽  
Scale Free ◽  
Transport Dynamics ◽  
Big City ◽  
Free Network ◽  
Bus Network ◽  
Assortative Network

The transport network structure plays a crucial role in transport dynamics. To better understand the property of the bus network in big city and reasonably configure the bus lines and transfers, this paper seeks to take the bus network of Beijing as an example and mainly use space L and space P to analyze the network topology properties. The approach is applied to all the bus lines in Beijing which includes 722 lines and 5421 bus station. In the first phase of the approach, space L is used. The results show that the bus network of Beijing is a scale-free network and the degree of more than 99 percent of nodes is lower than 10. The results also show that the network is an assortative network with 46 communities. In a second phase, space P is used to analyze the property of transfer. The results show that the average transfer time of Beijing bus network which is 1.88 and 99.8 percent of arbitrary two pair nodes is reachable within 4 transfers.

EXPRESS PASSENGER TRANSPORT SYSTEM AS A SCALE-FREE NETWORK

2006 ◽  
Vol 20 (27) ◽  
pp. 1755-1761 ◽  
Author(s):  
BAIBAI FU ◽  
ZIYOU GAO ◽  
FASHENG LIU ◽  
XIANJUAN KONG
Keyword(s):  
Transport System ◽  
Network Topology ◽  
Small World ◽  
Power Exponent ◽  
Scale Free Network ◽  
Passenger Transport ◽  
Scale Free ◽  
Scale Free Networks ◽  
Highway Network ◽  
Free Network

An express highway itself is not a scale-free network, while the Express Passenger Transport System (EPTS) on the express highway network has the properties of a small-world and scale-free network. Data analysis based on the observation of the EPTS in Shandong province, China, shows that the EPTS has the properties of scale-free networks and the power exponent λ of the distribution is equal to about 2.1. Based on the scale-free network topology structure of the EPTS network, the construction of the EPTS network will be more efficient and robust.

scholarly journals A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Guoyong Mao ◽  
Ning Zhang
Keyword(s):  
Complex Network ◽  
Shortest Path ◽  
Path Length ◽  
Large Scale ◽  
Computation Time ◽  
Scale Free Network ◽  
Original Network ◽  
Memory Space ◽  
Scale Free ◽  
Free Network

Computing the average shortest-path length (ASPL) of a large scale-free network needs much memory space and computation time. Based on the feature of scale-free network, we present a simplification algorithm by cutting the suspension points and the connected edges; the ASPL of the original network can be computed through that of the simplified network. We also present a multilevel simplification algorithm to get ASPL of the original network directly from that of the multisimplified network. Our experiment shows that these algorithms require less memory space and time in computing the ASPL of scale-free network, which makes it possible to analyze large networks that were previously impossible due to memory limitations.

scholarly journals Evaluating the Impact of Name Resolution Dependence on the DNS

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Haiyan Xu ◽  
Zhaoxin Zhang ◽  
Jianen Yan ◽  
Xin Ma
Keyword(s):  
Large Scale ◽  
Scale Free Network ◽  
Security Measures ◽  
Scale Free ◽  
Domain Names ◽  
The Core ◽  
Complex Dependence ◽  
Random Failure ◽  
Free Network ◽  
The Impact

In the process of resolving domain names to IP addresses, there exist complex dependence relationships between domains and name servers. This paper studies the impact of the resolution dependence on the DNS through constructing a domain name resolution network based on large-scale actual data. The core nodes of the resolution network are mined from different perspectives by means of four methods. Then, both core attacks and random attacks on the network are simulated for further vulnerability analysis. The experimental results show that when the top 1% of the core nodes in the network are attacked, 46.19% of the domain names become unresolved, and the load of the residual network increases by nearly 195%, while only 0.01% of domain names fail to be resolved and the load increases with 18% in the same attack scale of the random mode. For these key nodes, we need to take effective security measures to prevent them from being attacked. The simulation experiment also proves that the resolution network is a scale-free network, which exhibits robustness against random failure and vulnerability against intentional attacks. These findings provide new references for the configuration of the DNS.

Sign in / Sign up

Export Citation Format

Share Document