An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set (FVS) is a set ofâ€¦ (More)

Physical review. E, Statistical, nonlinear, andâ€¦

2008

We studied synchronization between prisoner's dilemma games with voluntary participation in two Newman-Watts small-world networks. It was found that there are three kinds of synchronization: partialâ€¦ (More)

A feedback vertex set (FVS) of an undirected graph contains vertices from every cycle of this graph. Constructing a FVS of sufficiently small cardinality is very difficult in the worst cases, but forâ€¦ (More)

We propose a novel network growth model coupled with the competition interaction to simulate macroevolution. Our work shows that the competition plays an important role in macroevolution and it isâ€¦ (More)

Physical review. E, Statistical, nonlinear, andâ€¦

2008

Neurons are subject to various kinds of noise. In addition to synaptic noise, the stochastic opening and closing of ion channels represents an intrinsic source of noise that affects theâ€¦ (More)

Physical review. E, Statistical, nonlinear, andâ€¦

2008

We have studied the effect of memory on the evolution of the prisoner's dilemma game in square lattice networks. Based on extensive simulations, we found that the density of cooperators was enhancedâ€¦ (More)

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 we should alsoâ€¦ (More)