114 citations · 229 across the 12 of their papers we have counts for
7 papers · 1 filter
Network reconstruction from asynchronously updated evolutionary game
Hong-Li Zeng, Shu-Xuan Wang, Yan-Dong Guo +1
The interactions between players of prisoner's dilemma (PD) game are reconstructed with evolutionary game data. All participants play the game with their counterparts and gain corr…
Two-distance minimal dominating set problem studied by statistical mechanics and simulated annealing
Yusupjan Habibulla, Shao-meng Qin
The L-distance (especially the 2-distance) minimal dominating set (MDS) problem is widely considered in various dominating set problems. Recently, we studied the regular dominating…
Spin-glass model for the C-dismantling problem
Shao-Meng Qin
C-dismantling (CD) problem aims at finding the minimum vertex set D of a graph G(V,E) after removing which the remaining graph will break into connected components with the size no…
Dismantle a network efficiently during the entire process by a compound algorithm
Shao-Meng Qin
The dismantling network problem only asks the minimal vertex set of a graph after removing which the remaining graph will break into connected components of sub-extensive size, but…
Coevolution of game and network structure: The temptation increases the cooperator density
Shao-Meng Qin, Guo-Yong Zhang, Yong Chen
Most papers about the evolutionary game on graph assume the statistic network structure. However, social interaction could change the relationship of people. And the changing socia…
Effect of memory on the prisoner's dilemma game in a square lattice
Shao-Meng Qin, Yong Chen, Xiao-Ying Zhao +1
We have studied the effect of memory on evolution of the prisoner's dilemma game using square lattice networks. Based on extensive simulations, we found that the density of coopera…