Epidemic spreading on networks with vaccination

In this paper, a new susceptible-infected-susceptible (SIS) model on complex networks with imperfect vaccination is proposed. Two types of epidemic spreading patterns (the recovered individuals have or have not immunity) on scale-free networks are discussed. Both theoretical and numerical analyses are presented. The epidemic thresholds related to the vaccination rate, the vaccination-invalid rate and the vaccination success rate on scale-free networks are demonstrated, showing different results from the reported observations. This reveals that whether or not the epidemic can spread over a network under vaccination control is determined not only by the network structure but also by the medicine's effective duration. Moreover, for a given infective rate, the proportion of individuals to vaccinate can be calculated theoretically for the case that the recovered nodes have immunity. Finally, simulated results are presented to show how to control the disease prevalence.     

Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap

In this paper,we study the scaling for the mean first-passage time(MFPT) of the random walks on a generalized Koch network with a trap.Through the network construction,where the initial state is transformed from a triangle to a polygon,we obtain the exact scaling for the MFPT.We show that the MFPT grows linearly with the number of nodes and the dimensions of the polygon in the large limit of the network order.In addition,we determine the exponents of scaling efficiency characterizing the random walks.Our results are the generalizations of those derived for the Koch network,which shed light on the analysis of random walks over various fractal networks.     

Does the eigenratio synchronizability of λ2/λN represent the a complex network？

In the study of complex networks, it is commonly believed that the eigenratio λ2/λN of the Laplacian matrix of a network represents the network synchronizability, especially for symmetric networks. This paper gives two counterexamples to show that this is not true for the case where the network has a disconnected synchronized region. Consequently, a simple answer is presented to the question of when the eigenratio λ2/λN does represent the network synchronizability.     

Undetermination of the synchronizability and relation between network betweenness centrality

Betweenness centrality is taken as a sensible indicator of the synchronizability of complex networks. To test whether betweenness centrality is a proper measure of the synchronizability in specific realizations of random networks, this paper adds edges to the networks and then evaluates the changes of betweenness centrality and network synchronizability. It finds that the two quantities vary independently.     

一类平面Hamilton系统的大范围非线性化近似方法

在非线性动力系统的研究已经进入了占主导地位的时期,对其提出大范围的非线性化近似方法具有特别重要的意义.在本文中,我们主要对于一类典型的Hamilton系统,根据等势线有两个,或者三个交点的不同情形,给出7种不同的大范围最低次非线性化近似系统,并通过积分近似系统给出近似解(轨道).结果表明,近似椭圆周期轨道可通过线性化近似系统得到,而同(异)宿轨道则可通过2、3次非线性化近似系统得到.最后,将近似方法应用于一个具体Hamilton系统的分析.     

确定延迟反馈法控制混沌的可控性条件

基于数学上延迟（时滞）系统Hopf分支理论及分析方法，解析地确定出 用延迟反馈法可控制三阶自治混沌系统的一般条件.利用这种分析方法，着重从理论上 讨论了在控制意义下系统出现稳定周期解及由Hopf分支产生周期解的分支方向的判据.将这 些理论应用到三阶自治混沌系统的控制实例中，解析地得到使系统可控的参量区域.在该区 域内选择控制参量，通过数值模拟也得到控制系统从混沌到周期态的结果. 关键词： 延迟反馈 Hopf分支 控制混沌     

广义符号动力系统的混沌性

本文给出了符号动力系统的一般数学模型,它是离散时空系统的一种特殊情形.在现有离散时空系统的混沌概念和研究方法的基础上.研究了这类广义符号动力系统的混沌性,得到了一类在Devaney意义下新的广义符号混沌动力系统,从而推广了现有符号动力系统混沌性的研究范围.     

超混沌振荡器的混沌耦合同步

提出了两种应用单变量单向混沌耦合同步超混沌振荡器的同步方案。首先给出了混沌耦合同步方案的数学证明，然后通过数值仿真证实了该混沌耦合同步方案的正确性和有效性。最后通过计算条件李雅谱诺夫指数，比较了不同耦合强度下，两种混沌耦合同步和典型的连续耦合同步的同步性能。计算表明在一定的耦合强度下，混沌耦合比典型的连续耦合同步速度快。     

超混沌振荡器的单变量单向耦合同步及其电路实验仿真

研究了一个超混沌振荡器的耦合同步问题,只用单变量单向耦合就可实现两个超混沌振荡器的同步.本方法的最大特点是易于工程实现.数值研究和电路实验仿真证明了本方法的有效性.电路实验仿真中出现一种新的同步现象,即系统的某个变量达到广义同步时,其他变量还可以实现精确同步     

A new coupled-map car-following model based on a transportation supernetwork framework

A new car-following model is proposed by considering information from a number of preceding vehicles with intervehicle communication. A supernetwork architecture is first described, which has two layers： a traffic network and a communication network. The two networks interact with and depend on each other. The error dynamic system around the steady state of the model is theoretically analyzed and some nonjam criteria are derived. A simple control signal is added to the model to analyze the criteria of suppressing traffic jams. The corresponding numerical simulations confirm the correctness of the theoretical analysis. Compared with previous studies concerning coupled map models, the controlled model proposed in this paper is more reasonable and also more effective in the sense that it takes into account the formation of traffic congestion.