On Link Density and Network Synchronization in Scale-Free Network

2013 ◽  
Vol 380-384 ◽  
pp. 2276-2279
Author(s):  
Wen Wei Liu ◽  
Dan Wang

The relations between link density and network synchronizability based on scale-free weighted networks is investigated. In this work, it shows that synchronizability of networks Type I decrease along with the increases of link density, when the netwrok size is fixed. While the synchronizability of networks Type II is remarkable decreased by enhancing the link density with different network size.

2016 ◽  
Vol 27 (03) ◽  
pp. 1650024 ◽  
Author(s):  
J. B. de Brito ◽  
C. I. N. Sampaio Filho ◽  
A. A. Moreira ◽  
J. S. Andrade

When studying topological or dynamical properties of random scale-free networks, it is tacitly assumed that degree–degree correlations are not present. However, simple constraints, such as the absence of multiple edges and self-loops, can give rise to intrinsic correlations in these structures. In the same way that Fermionic correlations in thermodynamic systems are relevant only in the limit of low temperature, the intrinsic correlations in scale-free networks are relevant only when the extreme values for the degrees grow faster than the square root of the network size. In this situation, these correlations can significantly affect the dependence of the average degree of the nearest neighbors of a given vertex on this vertices degree. Here, we introduce an analytical approach that is capable to predict the functional form of this property. Moreover, our results indicate that random scale-free network models are not self-averaging, that is, the second moment of their degree distribution may vary orders of magnitude among different realizations. Finally, we argue that the intrinsic correlations investigated here may have profound impact on the critical properties of random scale-free networks.


2008 ◽  
Vol 22 (04) ◽  
pp. 435-445 ◽  
Author(s):  
ZHENGPING WU ◽  
ZHI-HONG GUAN

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.


Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 299 ◽  
Author(s):  
Yuhui Gong ◽  
Qian Yu

Conformity is a common phenomenon among people in social networks. In this paper, we focus on customers’ conformity behaviors in a symmetry market where customers are located in a social network. We establish a conformity model and analyze it in ring network, random network, small-world network, and scale-free network. Our simulations shown that topology structure, network size, and initial market share have significant effects on the evolution of customers’ conformity behaviors. The market will likely converge to a monopoly state in small-world networks but will form a duopoly market in scale networks. As the size of the network increases, there is a greater possibility of forming a dominant group of preferences in small-world network, and the market will converge to the monopoly of the product which has the initial selector in the market. Also, network density will become gradually significant in small-world networks.


2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO

Sign in / Sign up

Export Citation Format

Share Document