scholarly journals COOPERATION ON SOCIAL NETWORKS AND ITS ROBUSTNESS

2012 ◽  
Vol 15 (supp01) ◽  
pp. 1250046 ◽  
Author(s):  
ALBERTO ANTONIONI ◽  
MARCO TOMASSINI
Keyword(s):  
Social Networks ◽  
Population Dynamics ◽  
Numerical Simulations ◽  
Population Model ◽  
Evolutionary Games ◽  
Computer Models ◽  
Scale Free ◽  
Average Payoff ◽  
Scale Free Networks ◽  
Update Rules

In this work we have used computer models of social-like networks to show by extensive numerical simulations that cooperation in evolutionary games can emerge and be stable on this class of networks. The amounts of cooperation reached are at least as much as in scale-free networks but here the population model is more realistic. Cooperation is robust with respect to different strategy update rules, population dynamics, and payoff computation. Only when straight average payoff is used or there is high strategy or network noise does cooperation decrease in all games and disappear in the Prisoner's Dilemma.

Effect of connection on transport between scale free networks

2017 ◽  
Vol 28 (05) ◽  
pp. 1750064 ◽  
Author(s):  
A. Ould Baba ◽  
O. Bamaarouf ◽  
A. Rachadi ◽  
H. Ez-Zahraouy
Keyword(s):  
Numerical Simulations ◽  
Power Law ◽  
Preferential Attachment ◽  
Electrical Conductance ◽  
Global Network ◽  
Scale Free ◽  
Scale Free Networks ◽  
Conductance Distribution

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.

scholarly journals Simple reaction-diffusion population model on scale-free networks

2008 ◽  
Vol 78 (4) ◽  
Author(s):  
An-Cai Wu ◽  
Xin-Jian Xu ◽  
J. F. F. Mendes ◽  
Ying-Hai Wang
Keyword(s):  
Population Model ◽  
Reaction Diffusion ◽  
Scale Free ◽  
Simple Reaction ◽  
Scale Free Networks

CASCADING FAILURES IN BARABÁSI–ALBERT SCALE-FREE NETWORKS WITH A BREAKDOWN PROBABILITY

2009 ◽  
Vol 20 (04) ◽  
pp. 585-595 ◽  
Author(s):  
JIAN-WEI WANG ◽  
LI-LI RONG
Keyword(s):  
Theoretical Analysis ◽  
Numerical Simulations ◽  
Cascading Failures ◽  
Scale Free ◽  
Scale Free Networks ◽  
Initial Load ◽  
Breakdown Probability ◽  
Proportional Relationship ◽  
Simulation Results ◽  
Failed Node

In this paper, adopting the initial load of a node j to be [Formula: see text], where kj is the degree of the node j and α is a tunable parameter that controls the strength of the initial load of a node, we propose a cascading model with a breakdown probability and explore cascading failures on a typical network, i.e., the Barabási–Albert (BA) network with scale-free property. Assume that a failed node leads only to a redistribution of the load passing through it to its neighboring nodes. According to the simulation results, we find that BA networks reach the strongest robustness level against cascading failures when α = 1 and the robustness of networks has a positive correlation with the average degree 〈k〉, not relating to the different breakdown probabilities. In addition, it is found that the robustness against cascading failures has an inversely proportional relationship with the breakdown probability of an overload node. Finally, the numerical simulations are verified by the theoretical analysis.

scholarly journals ADVERTISING AND IRREVERSIBLE OPINION SPREADING IN COMPLEX SOCIAL NETWORKS

2009 ◽  
Vol 20 (06) ◽  
pp. 799-815 ◽  
Author(s):  
JULIÁN CANDIA
Keyword(s):  
Social Networks ◽  
Small World ◽  
Cost Effective ◽  
Thermal Bath ◽  
Scale Free ◽  
Effective Strategies ◽  
Scale Free Networks ◽  
Variable Duration ◽  
Link Density ◽  
Spin Flips

Irreversible opinion spreading phenomena are studied on small-world and scale-free networks by means of the magnetic Eden model, a nonequilibrium kinetic model for the growth of binary mixtures in contact with a thermal bath. In this model, the opinion of an individual is affected by those of their acquaintances, but opinion changes (analogous to spin flips in an Ising-like model) are not allowed. We focus on the influence of advertising, which is represented by external magnetic fields. The interplay and competition between temperature and fields lead to order–disorder transitions, which are found to also depend on the link density and the topology of the complex network substrate. The effects of advertising campaigns with variable duration, as well as the best cost-effective strategies to achieve consensus within different scenarios, are also discussed.

scholarly journals Parent-preferred dispersal promotes cooperation in structured populations

2019 ◽  
Vol 286 (1895) ◽  
pp. 20181949 ◽  
Author(s):  
Xiaojie Chen ◽  
Åke Brännström ◽  
Ulf Dieckmann
Keyword(s):  
Pairwise Comparison ◽  
Small World ◽  
Structured Populations ◽  
Evolution Of Cooperation ◽  
Pair Approximation ◽  
Scale Free ◽  
Scale Free Networks ◽  
Different Types ◽  
Population Structures ◽  
Update Rules

Dispersal is a key process for the emergence of social and biological behaviours. Yet, little attention has been paid to dispersal's effects on the evolution of cooperative behaviour in structured populations. To address this issue, we propose two new dispersal modes, parent-preferred and offspring-preferred dispersal, incorporate them into the birth–death update rule, and consider the resultant strategy evolution in the prisoner's dilemma on random-regular, small-world, and scale-free networks, respectively. We find that parent-preferred dispersal favours the evolution of cooperation in these different types of population structures, while offspring-preferred dispersal inhibits the evolution of cooperation in homogeneous populations. On scale-free networks when the strength of parent-preferred dispersal is weak, cooperation can be enhanced at intermediate strengths of offspring-preferred dispersal, and cooperators can coexist with defectors at high strengths of offspring-preferred dispersal. Moreover, our theoretical analysis based on the pair-approximation method corroborates the evolutionary outcomes on random-regular networks. We also incorporate the two new dispersal modes into three other update rules (death-birth, imitation, and pairwise comparison updating), and find that similar results about the effects of parent-preferred and offspring-preferred dispersal can again be observed in the aforementioned different types of population structures. Our work, thus, unveils robust effects of preferential dispersal modes on the evolution of cooperation in different interactive environments.

VULNERABILITY OF EFFECTIVE ATTACK ON EDGES IN SCALE-FREE NETWORKS DUE TO CASCADING FAILURES

2009 ◽  
Vol 20 (08) ◽  
pp. 1291-1298 ◽  
Author(s):  
JIAN-WEI WANG ◽  
LI-LI RONG
Keyword(s):  
Theoretical Prediction ◽  
Numerical Simulations ◽  
Real Life ◽  
Network Robustness ◽  
Critical Threshold ◽  
Cascading Failure ◽  
Cascading Failures ◽  
Scale Free ◽  
Scale Free Networks ◽  
Initial Load

Assume the initial load of an edge ij in a network to be Lij =[(ki ∑a ∈ Γi ka)(kj ∑b ∈ Γj kb)]α with ki and kj being the degrees of the nodes connected by the edge, where α is a tunable parameter which controls the strength of the edge initial load, and Γi and Γj are the sets of neighboring nodes of i and j, respectively. We investigate the cascading phenomenon of uncorrelated scale-free networks subject to two different attacking strategies on edges, i.e. attacking on the edges with the highest loads or the lowest loads (LL). By the critical threshold of edge capacity quantifying the network robustness, we numerically discuss the effects of two attacks for the network vulnerability. Interestingly, it is found that the attack on the edge with the LL is highly effective in disrupting the structure of the attacked network when α < 0.5. In the case of α = 0.5, the effects of two attacks for the network robustness against cascading failures are almost identical. We furthermore provide the theoretical prediction support for the numerical simulations. These results may be very helpful for real-life networks to protect the key edges selected effectively to avoid cascading-failure-induced disasters.

scholarly journals On ISRC Rumor Spreading Model for Scale-Free Networks with Self-Purification Mechanism

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Zijun Wang ◽  
An Chen
Keyword(s):  
Numerical Simulations ◽  
Model Parameters ◽  
Rumor Spreading ◽  
Scale Free ◽  
Spreading Model ◽  
Scale Free Networks ◽  
Simulation Results ◽  
Key Indicators ◽  
The Impact

At present, the feasibility of using self-purification mechanism to inhibit rumor spreading has been confirmed by studies from different perspectives. This paper improves the classical rumor spreading models with self-purification mechanism, analyzes the correlation between spreading threshold in the model and its self-purification level theoretically, and conducts numerical simulations to study the impact of the changes of model parameters on key indicators in the process of rumor spreading. The simulation results show that changes of model parameters, including self-purification level and forgetting rate, exert significant influences on rumor spreading exactly.

Sign in / Sign up

Export Citation Format

Share Document