scholarly journals Modeling and Analysis of New Products Diffusion on Heterogeneous Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Shuping Li ◽  
Zhen Jin

We present a heterogeneous networks model with the awareness stage and the decision-making stage to explain the process of new products diffusion. If mass media is neglected in the decision-making stage, there is a threshold whether the innovation diffusion is successful or not, or else it is proved that the network model has at least one positive equilibrium. For networks with the power-law degree distribution, numerical simulations confirm analytical results, and also at the same time, by numerical analysis of the influence of the network structure and persuasive advertisements on the density of adopters, we give two different products propagation strategies for two classes of nodes in scale-free networks.

2007 ◽  
Vol 17 (07) ◽  
pp. 2447-2452 ◽  
Author(s):  
S. BOCCALETTI ◽  
D.-U. HWANG ◽  
V. LATORA

We introduce a fully nonhierarchical network growing mechanism, that furthermore does not impose explicit preferential attachment rules. The growing procedure produces a graph featuring power-law degree and clustering distributions, and manifesting slightly disassortative degree-degree correlations. The rigorous rate equations for the evolution of the degree distribution and for the conditional degree-degree probability are derived.


2016 ◽  
Vol 27 (11) ◽  
pp. 1650125 ◽  
Author(s):  
Han-Xin Yang ◽  
Bing-Hong Wang

We study the traffic-driven epidemic spreading on scale-free networks with tunable degree distribution. The heterogeneity of networks is controlled by the exponent [Formula: see text] of power-law degree distribution. It is found that the epidemic threshold is minimized at about [Formula: see text]. Moreover, we find that nodes with larger algorithmic betweenness are more likely to be infected. We expect our work to provide new insights in to the effect of network structures on traffic-driven epidemic spreading.


2007 ◽  
Vol 56 (10) ◽  
pp. 5635
Author(s):  
Guo Jin-Li ◽  
Wang Li-Na

2017 ◽  
Vol 28 (05) ◽  
pp. 1750064 ◽  
Author(s):  
A. Ould Baba ◽  
O. Bamaarouf ◽  
A. Rachadi ◽  
H. Ez-Zahraouy

Using numerical simulations, we investigate the effects of the connectivity and topologies of network on the quality of transport between connected scale free networks. Hence, the flow as the electrical conductance between connected networks is calculated. It is found that the conductance distribution between networks follow a power law [Formula: see text] where [Formula: see text] is the exponent of the global Network of network, we show that the transport in the symmetric growing preferential attachment connection is more efficient than the symmetric static preferential attachment connection. Furthermore, the differences of transport and networks communications properties in the different cases are discussed.


2013 ◽  
Vol 753-755 ◽  
pp. 2959-2962
Author(s):  
Jun Tao Yang ◽  
Hui Wen Deng

Assigning the value of interest to each node in the network, we give a scale-free network model. The value of interest is related to the fitness and the degree of the node. Experimental results show that the interest model not only has the characteristics of the BA scale-free model but also has the characteristics of fitness model, and the network has a power-law distribution property.


2018 ◽  
Vol 21 ◽  
pp. 00012
Author(s):  
Andrzej Paszkiewicz

The paper concerns the use of the scale-free networks theory and the power law in designing wireless networks. An approach based on generating random networks as well as on the classic Barabási-Albert algorithm were presented. The paper presents a new approach taking the limited resources for wireless networks into account, such as available bandwidth. In addition, thanks to the introduction of opportunities for dynamic node removal it was possible to realign processes occurring in wireless networks. After introduction of these modifications, the obtained results were analyzed in terms of a power law and the degree distribution of each node.


2007 ◽  
Vol 17 (07) ◽  
pp. 2419-2434 ◽  
Author(s):  
FRANCESCO SORRENTINO ◽  
MARIO DI BERNARDO ◽  
FRANCO GAROFALO

We study the synchronizability and the synchronization dynamics of networks of nonlinear oscillators. We investigate how the synchronization of the network is influenced by some of its topological features such as variations of the power law degree distribution exponent γ and the degree correlation coefficient r. Using an appropriate construction algorithm based on clustering the network vertices in p classes according to their degrees, we construct networks with an assigned power law distribution but changing degree correlation properties. We find that the network synchronizability improves when the network becomes disassortative, i.e. when nodes with low degree are more likely to be connected to nodes with higher degree. We consider the case of both weighed and unweighed networks. The analytical results reported in the paper are then confirmed by a set of numerical observations obtained on weighed and unweighed networks of nonlinear Rössler oscillators. Using a nonlinear optimization strategy we also show that negative degree correlation is an emerging property of networks when synchronizability is to be optimized. This suggests that negative degree correlation observed experimentally in a number of physical and biological networks might be motivated by their need to synchronize better.


Sign in / Sign up

Export Citation Format

Share Document