The research on tit-for-tat strategy in network evolution

For the node who detect most, its neighbors tends to cut their relationship and setup a new line with other neighbor, this situation fit for real world. This paper puts forward a new pseudo value first algorithm based on tit-for-tat strategy in game theory and studies the network statistic characters with the network nodes unchanged. The simulation results show that the new algorithm cannot change scale free character but can change the maximum value in network and its clustering coefficient. On the other hand, we also study the effect of this new algorithm on network community structure, results show it can optimize the community structure.