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

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

Synchronization of Coupled Oscillators on Newman-Watts Small-World Networks

We investigate the collection behaviour of coupled phase oscillators on Newman-Watts small-world networks in one and two dimensions. Each component of the network is assumed as an oscillator and each interacts with the others following the Kuramoto model We then study the onset of global synchronization of phases and frequencies based on dynamic simulations and finite-size scaling. Both the phase and frequency synchronization are observed to emerge in the presence of a tiny fraction of shortcuts and enhanced with the increases of nearest neighbours and lattice dimensions.  

Phase Locking Phenomena and Electroencephalogram-Like Activities in Dynamic Neuronal Systems

We study signal detection and transduction of dynamic neuronal systems under the influence of external noise,white and coloured. Based on simulations, we show explicitly phase locking phenomena between the output and the input of a single neuron and Electroencephalogram-like activities on neural networks with small-world connectivity. The numerical results prove that the dynamic neuronal system can be adjusted to an optimal sensitive state for signal processing in the presence of additive noise.  

Evolution of Weighted Networks with Exponential Aging of Sites

We study the growth of weighted networks with exponential aging of sites. Each new vertex of the network is connected to some old vertices with proportional (i) to the strength of the old vertex and (ii) to e^-αT, where T is the age of the old vertex and α is a positive constant. As soon as the preferential attachment is modified by such factors, the interesting quantities of the produced network (the vertex degree, vertex strength, clustering coefficient and average path length) will be significantly transformed.  

Prisoner＇s Dilemma Game with Heterogeneous Influential Effect on Regular Small-World Networks

The effect of heterogeneous influence of different individuals on the maintenance of co-operative behaviour is studied in an evolutionary Prisoner＇s Dilemma game with players located on the sites of regular small-world networks. The players interacting with their neighbours can either co-operate or defect and update their states by choosing one of the neighbours and adopting its strategy with a probability depending on the pay off difference. The selection of the neighbour obeys a preferential rule： the more influential a neighbour, the larger the probability it is picked. It is found that this simple preferential selection rule can promote continuously the co-operation of the whole population with the strengthening of the disorder of the underlying network.  

Rank-based deactivation model for networks with age

We study the impact of age on network evolution which couples addition of new nodes and deactivation of old ones. During evolution, each node experiences two stages: active and inactive. The transition from the active state to the inactive one is based on the rank of the node. In this paper, we adopt age as a criterion of ranking, and propose two deactivation models that generalize previous research. In model A, the older active node possesses the higher rank, whereas in model B, the younger active node takes the higher rank. We make a comparative study between the two models through the node-degree distribution.  

Generating weighted community networks based on local events

Many realistic networks have community structures,namely,a network consists of groups of nodes within which links are dense but among which links are sparse.This paper proposes a growing network model based on local processes,the addition of new nodes intra-community and new links intra-or inter-community.Also,it utilizes the preferential attachment for building connections determined by nodes’ strengths,which evolves dynamically during the growth of the system.The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes’ degrees and strengths.  

Improving consensual performance of multi-agent systems in weighted scale-free networks

This paper studies consensus problems in weighted scale-free networks of asymmetrically coupled dynamical units, where the asymmetry in a given link is determined by the relative degree of the involved nodes. It shows that the asymmetry of interactions has a great effect on the consensus. Especially, when the interactions are dominant from higher- to lower-degree nodes, both the convergence speed and the robustness to communication delay are enhanced.  

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.  

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.