اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimple rules govern finite-size effects in scale-free networks
121
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree distribution. We use two different approaches: the deterministic mean-field approximation used by Barabasi and Albert (but taking into account the nodes of the starting network), and the probability distribution of the degree of each node, which considers the stochastic process. Numerical simulations show that the accuracy of the predictions of the mean-field approximation depend on the contribution of the dispersion in the final distribution. The results in terms of the probability distribution of the degree of each node are very accurate when compared to numerical simulations. The analysis of the standard deviation of the degree distribution allows us to assess the influence of the starting core when fitting the model to real data.
قيم البحث
اقرأ أيضاً
Networks with a scale-free degree distribution are widely thought to promote cooperation in various games. Herein, by studying the well-known prisoners dilemma game, we demonstrate that this need not necessarily be true. For the very same degree sequ
ence and degree distribution, we present a variety of possible behaviour. We reassess the perceived importance of hubs in a network towards the maintenance of cooperation. We also reevaluate the dependence of cooperation on network clustering and assortativity.
The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any infection will
perpetually propagate regardless of the spreading rate. The vast majority of current theoretical approaches assumes that infections are transmitted as a reaction process from nodes to all neighbors. Here we adopt a different perspective and show that the epidemic incidence is shaped by traffic flow conditions. Specifically, we consider the scenario in which epidemic pathways are defined and driven by flows. Through extensive numerical simulations and theoretical predictions, it is shown that the value of the epidemic threshold in scale-free networks depends directly on flow conditions, in particular on the first and second moments of the betweenness distribution given a routing protocol. We consider the scenarios in which the delivery capability of the nodes is bounded or unbounded. In both cases, the threshold values depend on the traffic and decrease as flow increases. Bounded delivery provokes the emergence of congestion, slowing down the spreading of the disease and setting a limit for the epidemic incidence. Our results provide a general conceptual framework to understand spreading processes on complex networks.
Taking into account the fact that overload failures in real-world functional networks are usually caused by extreme values of temporally fluctuating loads that exceed the allowable range, we study the robustness of scale-free networks against cascadi
ng overload failures induced by fluctuating loads. In our model, loads are described by random walkers moving on a network and a node fails when the number of walkers on the node is beyond the node capacity. Our results obtained by using the generating function method shows that scale-free networks are more robust against cascading overload failures than ErdH{o}s-Renyi random graphs with homogeneous degree distributions. This conclusion is contrary to that predicted by previous works which neglect the effect of fluctuations of loads.
Weak ties play a significant role in the structures and the dynamics of community networks. Based on the susceptible-infected model in contact process, we study numerically how weak ties influence the predictability of epidemic dynamics. We first inv
estigate the effects of different kinds of weak ties on the variabilities of both the arrival time and the prevalence of disease, and find that the bridgeness with small degree can enhance the predictability of epidemic spreading. Once weak ties are settled, compared with the variability of arrival time, the variability of prevalence displays a diametrically opposed changing trend with both the distance of the initial seed to the bridgeness and the degree of the initial seed. More specifically, the further distance and the larger degree of the initial seed can induce the better predictability of arrival time and the worse predictability of prevalence. Moreover, we discuss the effects of weak tie number on the epidemic variability. As community strength becomes very strong, which is caused by the decrease of weak tie number, the epidemic variability will change dramatically. Compared with the case of hub seed and random seed, the bridgenss seed can result in the worst predictability of arrival time and the best predictability of prevalence. These results show that the variability of arrival time always marks a complete reversal trend of that of prevalence, which implies it is impossible to predict epidemic spreading in the early stage of outbreaks accurately.
We investigate the effect of a specific edge weighting scheme $sim (k_i k_j)^{beta}$ on distributed flow efficiency and robustness to cascading failures in scale-free networks. In particular, we analyze a simple, yet fundamental distributed flow mode
l: current flow in random resistor networks. By the tuning of control parameter $beta$ and by considering two general cases of relative node processing capabilities as well as the effect of bandwidth, we show the dependence of transport efficiency upon the correlations between the topology and weights. By studying the severity of cascades for different control parameter $beta$, we find that network resilience to cascading overloads and network throughput is optimal for the same value of $beta$ over the range of node capacities and available bandwidth.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
