1,095 research outputs found
Nonlinear analysis of dynamical complex networks
Copyright © 2013 Zidong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Complex networks are composed of a large number of highly interconnected dynamical units and therefore exhibit very complicated dynamics. Examples of such complex networks include the Internet, that is, a network of routers or domains, the World Wide Web (WWW), that is, a network of websites, the brain, that is, a network of neurons, and an organization, that is, a network of people. Since the introduction of the small-world network principle, a great deal of research has been focused on the dependence of the asymptotic behavior of interconnected oscillatory agents on the structural properties of complex networks. It has been found out that the general structure of the interaction network may play a crucial role in the emergence of synchronization phenomena in various fields such as physics, technology, and the life sciences
A review on analysis and synthesis of nonlinear stochastic systems with randomly occurring incomplete information
Copyright q 2012 Hongli Dong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In the context of systems and control, incomplete information refers to a dynamical system in which knowledge about the system states is limited due to the difficulties in modeling complexity in a quantitative way. The well-known types of incomplete information include parameter uncertainties and norm-bounded nonlinearities. Recently, in response to the development of network technologies, the phenomenon of randomly occurring incomplete information has become more and more prevalent. Such a phenomenon typically appears in a networked environment. Examples include, but are not limited to, randomly occurring uncertainties, randomly occurring nonlinearities, randomly occurring saturation, randomly missing measurements and randomly occurring quantization. Randomly occurring incomplete information, if not properly handled, would seriously deteriorate the performance of a control system. In this paper, we aim to survey some recent advances on the analysis and synthesis problems for nonlinear stochastic systems with randomly occurring incomplete information. The developments of the filtering, control and fault detection problems are systematically reviewed. Latest results on analysis and synthesis of nonlinear stochastic systems are discussed in great detail. In addition, various distributed filtering technologies over sensor networks are highlighted. Finally, some concluding remarks are given and some possible future research directions are pointed out. © 2012 Hongli Dong et al.This work was supported in part by the National Natural Science Foundation of China under Grants 61273156, 61134009, 61273201, 61021002, and 61004067, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Science Foundation of the USA under Grant No. HRD-1137732, and the Alexander von Humboldt Foundation of German
Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Mathematical problems for complex networks
Copyright @ 2012 Zidong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This article is made available through the Brunel Open Access Publishing Fund.Complex networks do exist in our lives. The brain is a neural network. The global economy
is a network of national economies. Computer viruses routinely spread through the Internet. Food-webs, ecosystems, and metabolic pathways can be represented by networks. Energy is distributed through transportation networks in living organisms, man-made infrastructures, and other physical systems. Dynamic behaviors of complex networks, such as stability, periodic oscillation, bifurcation, or even chaos, are ubiquitous in the real world and often reconfigurable. Networks have been studied in the context of dynamical systems in a range of disciplines. However, until recently there has been relatively little work that treats dynamics as a function of network structure, where the states of both the nodes and the edges can change, and the topology of the network itself often evolves in time. Some major problems have not been fully investigated, such as the behavior of stability, synchronization and chaos control for complex networks, as well as their applications in, for example, communication and bioinformatics
Stability analysis of impulsive stochastic Cohen–Grossberg neural networks with mixed time delays
This is the post print version of the article. The official published version can be obtained from the link - Copyright 2008 Elsevier LtdIn this paper, the problem of stability analysis for a class of impulsive stochastic Cohen–Grossberg neural networks with mixed delays is considered. The mixed time delays comprise both the time-varying and infinite distributed delays. By employing a combination of the M-matrix theory and stochastic analysis technique, a sufficient condition is obtained to ensure the existence, uniqueness, and exponential p-stability of the equilibrium point for the addressed impulsive stochastic Cohen–Grossberg neural network with mixed delays. The proposed method, which does not make use of the Lyapunov functional, is shown to be simple yet effective for analyzing the stability of impulsive or stochastic neural networks with variable and/or distributed delays. We then extend our main results to the case where the parameters contain interval uncertainties. Moreover, the exponential convergence rate index is estimated, which depends on the system parameters. An example is given to show the effectiveness of the obtained results.This work was supported by the Natural Science Foundation of CQ CSTC under grant 2007BB0430, the Scientific Research Fund of Chongqing Municipal Education Commission under Grant KJ070401, an International Joint Project sponsored by the Royal Society of the UK and the National Natural Science Foundation of China, and the Alexander von Humboldt Foundation of Germany
Finite-size and correlation-induced effects in Mean-field Dynamics
The brain's activity is characterized by the interaction of a very large
number of neurons that are strongly affected by noise. However, signals often
arise at macroscopic scales integrating the effect of many neurons into a
reliable pattern of activity. In order to study such large neuronal assemblies,
one is often led to derive mean-field limits summarizing the effect of the
interaction of a large number of neurons into an effective signal. Classical
mean-field approaches consider the evolution of a deterministic variable, the
mean activity, thus neglecting the stochastic nature of neural behavior. In
this article, we build upon two recent approaches that include correlations and
higher order moments in mean-field equations, and study how these stochastic
effects influence the solutions of the mean-field equations, both in the limit
of an infinite number of neurons and for large yet finite networks. We
introduce a new model, the infinite model, which arises from both equations by
a rescaling of the variables and, which is invertible for finite-size networks,
and hence, provides equivalent equations to those previously derived models.
The study of this model allows us to understand qualitative behavior of such
large-scale networks. We show that, though the solutions of the deterministic
mean-field equation constitute uncorrelated solutions of the new mean-field
equations, the stability properties of limit cycles are modified by the
presence of correlations, and additional non-trivial behaviors including
periodic orbits appear when there were none in the mean field. The origin of
all these behaviors is then explored in finite-size networks where interesting
mesoscopic scale effects appear. This study leads us to show that the
infinite-size system appears as a singular limit of the network equations, and
for any finite network, the system will differ from the infinite system
Finite-time synchronization of Markovian neural networks with proportional delays and discontinuous activations
In this paper, finite-time synchronization of neural networks (NNs) with discontinuous activation functions (DAFs), Markovian switching, and proportional delays is studied in the framework of Filippov solution. Since proportional delay is unbounded and different from infinite-time distributed delay and classical finite-time analytical techniques are not applicable anymore, new 1-norm analytical techniques are developed. Controllers with and without the sign function are designed to overcome the effects of the uncertainties induced by Filippov solutions and further synchronize the considered NNs in a finite time. By designing new Lyapunov functionals and using M-matrix method, sufficient conditions are derived to guarantee that the considered NNs realize synchronization in a settling time without introducing any free parameters. It is shown that, though the proportional delay can be unbounded, complete synchronization can still be realized, and the settling time can be explicitly estimated. Moreover, it is discovered that controllers with sign function can reduce the control gains, while controllers without the sign function can overcome chattering phenomenon. Finally, numerical simulations are given to show the effectiveness of theoretical results
Recommended from our members
Non-fragile H∞ control with randomly occurring gain variations, distributed delays and channel fadings
This study is concerned with the non-fragile H∞ control problem for a class of discrete-time systems subject to randomly occurring gain variations (ROGVs), channel fadings and infinite-distributed delays. A new stochastic phenomenon (ROGVs), which is governed by a sequence of random variables with a certain probabilistic distribution, is put forward to better reflect the reality of the randomly occurring fluctuation of controller gains implemented in networked environments. A modified stochastic Rice fading model is then exploited to account for both channel fadings and random time-delays in a unified representation. The channel coefficients are a set of mutually independent random variables which abide by any (not necessarily Gaussian) probability density function on [0, 1]. Attention is focused on the analysis and design of a non-fragile H∞ outputfeedback controller such that the closed-loop control system is stochastically stable with a prescribed H∞ performance. Through intensive stochastic analysis, sufficient conditions are established for the desired stochastic stability and H∞ disturbance attenuation, and the addressed non-fragile control problem is then recast as a convex optimisation problem solvable via the semidefinite programme method. An example is finally provided to demonstrate the effectiveness of the proposed design method
Recommended from our members
Probability-dependent gain-scheduled control for discrete stochastic delayed systems with randomly occurring nonlinearities
This is the post-print version of the Article. The official published version can be accessed from the links below - Copyright @ 2012 John Wiley & Sons, Ltd.In this paper, the gain-scheduled control problem is addressed by using probability-dependent Lyapunov functions for a class of discrete-time stochastic delayed systems with randomly occurring sector nonlinearities. The sector nonlinearities are assumed to occur according to a time-varying Bernoulli distribution with measurable probability in real time. The multiplicative noises are given by means of a scalar Gaussian white noise sequence with known variances. The aim of the addressed gain-scheduled control problem is to design a controller with scheduled gains such that, for the admissible randomly occurring nonlinearities, time delays and external noise disturbances, the closed-loop system is exponentially mean-square stable. Note that the designed gain-scheduled controller is based on the measured time-varying probability and is therefore less conservative than the conventional controller with constant gains. It is shown that the time-varying controller gains can be derived in terms of the measurable probability by solving a convex optimization problem via the semi-definite programme method. A simulation example is exploited to illustrate the effectiveness of the proposed design procedures.This work was supported in part by the Leverhulme Trust of the UK, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the National Natural Science Foundation of China under Grants 61028008, 61134009, 61074016, 61104125 and 60974030, the Shanghai Natural Science Foundation of China under Grant 10ZR1421200, and the Alexander von Humboldt Foundation of Germany
- …