Related Experiment Video
Updated: May 4, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Robustness of cooperation on scale-free networks under continuous topological change
Genki Ichinose1, Yuto Tenguishi1, Toshihiro Tanizawa2
1Department of Systems and Control Engineering, Anan National College of Technology, 265 Aoki Minobayashi, Anan, Tokushima 774-0017, Japan.
Abstract:
In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where the network topologies change by continuous removal and addition of nodes. Each removal and addition can be either random or intentional. We therefore have four different strategies in changing network topology: random removal and random addition (RR), random removal and preferential addition (RP), targeted removal and random addition (TR), and targeted removal and preferential addition (TP). We find that cooperation clusters are most fragile against TR, while they are most robust against RP, even for large values of the temptation coefficient for defection. The effect of the degree mixing pattern of the network is not the primary factor for the robustness of cooperation under continuous change in network topology, which is quite different from the cases observed in static networks. Cooperation clusters become more robust as the number of links of hubs occupied by cooperators increase. Our results might infer the fact that a huge variety of individuals is needed for maintaining global cooperation in social networks in the real world where each node representing an individual is constantly removed and added.
Related Concept Videos
Stability of structures
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
Net Change Theorem
BIBO stability of continuous and discrete -time systems
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
Relationship Formation
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...

