856 research outputs found
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
Pinning dynamic systems of networks with Markovian switching couplings and controller-node set
In this paper, we study pinning control problem of coupled dynamical systems
with stochastically switching couplings and stochastically selected
controller-node set. Here, the coupling matrices and the controller-node sets
change with time, induced by a continuous-time Markovian chain. By constructing
Lyapunov functions, we establish tractable sufficient conditions for
exponentially stability of the coupled system. Two scenarios are considered
here. First, we prove that if each subsystem in the switching system, i.e. with
the fixed coupling, can be stabilized by the fixed pinning controller-node set,
and in addition, the Markovian switching is sufficiently slow, then the
time-varying dynamical system is stabilized. Second, in particular, for the
problem of spatial pinning control of network with mobile agents, we conclude
that if the system with the average coupling and pinning gains can be
stabilized and the switching is sufficiently fast, the time-varying system is
stabilized. Two numerical examples are provided to demonstrate the validity of
these theoretical results, including a switching dynamical system between
several stable sub-systems, and a dynamical system with mobile nodes and
spatial pinning control towards the nodes when these nodes are being in a
pre-designed region.Comment: 9 pages; 3 figure
Gossip and Distributed Kalman Filtering: Weak Consensus under Weak Detectability
The paper presents the gossip interactive Kalman filter (GIKF) for
distributed Kalman filtering for networked systems and sensor networks, where
inter-sensor communication and observations occur at the same time-scale. The
communication among sensors is random; each sensor occasionally exchanges its
filtering state information with a neighbor depending on the availability of
the appropriate network link. We show that under a weak distributed
detectability condition:
1. the GIKF error process remains stochastically bounded, irrespective of the
instability properties of the random process dynamics; and
2. the network achieves \emph{weak consensus}, i.e., the conditional
estimation error covariance at a (uniformly) randomly selected sensor converges
in distribution to a unique invariant measure on the space of positive
semi-definite matrices (independent of the initial state.)
To prove these results, we interpret the filtered states (estimates and error
covariances) at each node in the GIKF as stochastic particles with local
interactions. We analyze the asymptotic properties of the error process by
studying as a random dynamical system the associated switched (random) Riccati
equation, the switching being dictated by a non-stationary Markov chain on the
network graph.Comment: Submitted to the IEEE Transactions, 30 pages
Average Consensus Analysis of Distributed Inference with Uncertain Markovian Transition Probability
The average consensus problem of distributed inference in a wireless sensor network under Markovian communication topology of uncertain transition probability is studied. A sufficient condition for average consensus of linear distributed inference algorithm is presented. Based on linear matrix inequalities and numerical optimization, a design method of fast distributed inference is provided
- …