ﻻ يوجد ملخص باللغة العربية
Recent empirical research has shown that links between groups reinforce individuals within groups to adopt cooperative behaviour. Moreover, links between networks may induce cascading failures, competitive percolation, or contribute to efficient transportation. Here we show that there in fact exists an intermediate fraction of links between groups that is optimal for the evolution of cooperation in the prisoners dilemma game. We consider individual groups with regular, random, and scale-free topology, and study their different combinations to reveal that an intermediate interdependence optimally facilitates the spreading of cooperative behaviour between groups. Excessive between-group links simply unify the two groups and make them act as one, while too rare between-group links preclude a useful information flow between the two groups. Interestingly, we find that between-group links are more likely to connect two cooperators than in-group links, thus supporting the conclusion that they are of paramount importance.
Computer viruses are evolving by developing spreading mechanisms based on the use of multiple vectors of propagation. The use of the social network as an extra vector of attack to penetrate the security measures in IP networks is improving the effect
Epidemic spreading phenomena are ubiquitous in nature and society. Examples include the spreading of diseases, information, and computer viruses. Epidemics can spread by local spreading, where infected nodes can only infect a limited set of direct ta
The detection and management of diseases become quite complicated when pathogens contain asymptomatic phenotypes amongst their ranks, as evident during the recent COVID-19 pandemic. Spreading of diseases has been studied extensively under the paradig
Time-varying network topologies can deeply influence dynamical processes mediated by them. Memory effects in the pattern of interactions among individuals are also known to affect how diffusive and spreading phenomena take place. In this paper we ana
We study a multi-type SIR epidemic process among a heterogeneous population that interacts through a network. When we base social contact on a random graph with given vertex degrees, we give limit theorems on the fraction of infected individuals. For