It was theoretically proved that one-dimensional transiently chaotic neural networks have chaotic structure in sense of Li-Yorke theorem with some given assumptions using that no division implies chaos. In particular,...It was theoretically proved that one-dimensional transiently chaotic neural networks have chaotic structure in sense of Li-Yorke theorem with some given assumptions using that no division implies chaos. In particular, it is further derived sufficient conditions for the existence of chaos in sense of Li- Yorke theorem in chaotic neural network, which leads to the fact that Aihara has demonstrated by numerical method. Finally, an example and numerical simulation are shown to illustrate and reinforce the previous theory.展开更多
In this paper, by using the stability theory of stochastic differential equations, the average-consensus problem with noise perturbation is investigated. It is analytically proved that the consensus could be achieved ...In this paper, by using the stability theory of stochastic differential equations, the average-consensus problem with noise perturbation is investigated. It is analytically proved that the consensus could be achieved with a probability of one. Furthermore, numerical examples are taken to illustrate the effectiveness of the theoretical result.展开更多
This paper investigates the chaotic synchronization between the noise-perturbed Lorenz system and one of the noise-perturbed Chen and Lii systems. Based on the active control method and the Lyapunov theory in stochast...This paper investigates the chaotic synchronization between the noise-perturbed Lorenz system and one of the noise-perturbed Chen and Lii systems. Based on the active control method and the Lyapunov theory in stochastic differential equations, sufficient conditions for the stability of the error dynamics are derived. Numerical simulations are also shown to demonstrate the effectiveness of these theoretic results.展开更多
In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability t...In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.展开更多
基金the National Natural Science Foundation of China (70271065)
文摘It was theoretically proved that one-dimensional transiently chaotic neural networks have chaotic structure in sense of Li-Yorke theorem with some given assumptions using that no division implies chaos. In particular, it is further derived sufficient conditions for the existence of chaos in sense of Li- Yorke theorem in chaotic neural network, which leads to the fact that Aihara has demonstrated by numerical method. Finally, an example and numerical simulation are shown to illustrate and reinforce the previous theory.
文摘In this paper, by using the stability theory of stochastic differential equations, the average-consensus problem with noise perturbation is investigated. It is analytically proved that the consensus could be achieved with a probability of one. Furthermore, numerical examples are taken to illustrate the effectiveness of the theoretical result.
基金supported by the National Natural Science Foundation of China (Grant No. 10901145)
文摘This paper investigates the chaotic synchronization between the noise-perturbed Lorenz system and one of the noise-perturbed Chen and Lii systems. Based on the active control method and the Lyapunov theory in stochastic differential equations, sufficient conditions for the stability of the error dynamics are derived. Numerical simulations are also shown to demonstrate the effectiveness of these theoretic results.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61203304,61203055,and 11226150)the Fundamental Research Funds for the Central Universities,China (Grant Nos. 2011QNA26,2010LKSX04,and 2010LKSX09)
文摘In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.
