Walks on Weighted Networks

We investigate the dynamics of random walks on weighted networks. Assuming that the edge weight and the node strength are used as local information by a random walker. Two kinds of walks, weight-dependent walk and strength-dependent walk, are studied. Exact expressions for stationary distribution and average return time are derived and confirmed by computer simulations. The distribution of average return time and the mean-square displacement are calculated for two walks on the Barrat-Barthelemy-Vespignani （BBV） networks. It is found that a weight-dependent walker can arrive at a new territory more easily than a strength-dependent one.     

Evolutionary snowdrift game with disordered environments in mobile societies

We investigate an evolutionary snowdrift game on a square $N=L\times L$ lattice with periodic boundary conditions, where a population of $n_{0}$ ($n_{0}\leq N$) players located on the sites of this lattice can either cooperate with or defect from their nearest neighbours. After each generation, every player moves with a certain probability $p$ to one of the player's nearest empty sites. It is shown that, when $p=0$, the cooperative behaviour can be enhanced in disordered structures. When $p>0$, the effect of mobility on cooperation remarkably depends on the payoff parameter $r$ and the density of individuals $\rho$ ($\rho=n_{0}/N$). Compared with the results of $p=0$, for small $r$, the persistence of cooperation is enhanced at not too small values of $\rho$; whereas for large $r$, the introduction of mobility inhibits the emergence of cooperation at any $\rho<1$; for the intermediate value of $r$, the cooperative behaviour is sometimes enhanced and sometimes inhibited, depending on the values of $p$ and $\rho$. In particular, the cooperator density can reach its maximum when the values of $p$ and $\rho$ reach their respective optimal values. In addition, two absorbing states of all cooperators and all defectors can emerge respectively for small and large $r$ in the case of $p>0$.     

Synchronization of coupled logistic maps on random community networks

The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter rn, and the other is the ratio σ of the connection probability p of each pair of nodes within each community to the connection probability q of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger rn and smaller σ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.     

同伦分析法在求解非线性演化方程中的应用

利用同伦分析法求解了(2+1)维改进的 Zakharov-Kuznetsov方程, 得到了它的近似周期解,该解与精确解符合很好. 结果表明，同伦分析法在求解高维非线性演化方程时, 仍然是一种行之有效的方法. 同时,还对该方法进行了一定的扩展， 经过扩展后的方法能够更方便地求解更多非线性演化方程的高精度近似解析解. 关键词： 同伦分析法 改进的 Zakharov-Kuznetsov方程 周期解