By Topic

Distributed Averaging Under Constraints on Information Exchange: Emergence of Lévy Flights

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jing Wang ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA ; Elia, N.

In this paper, we study the fragility of a popular distributed averaging algorithm when the information exchange among the nodes is limited by communication delays, fading connections and additive noise. We show that the otherwise well studied and benign multi-agent system can generate a collective global complex behavior. We characterize this behavior, common to many natural and human-made interconnected systems, as a collective hyper-jump diffusion process and as a Lévy flight process in a special case. We further describe the mechanism for its emergence and predict its occurrence, under standard assumptions, by checking the Mean Square instability of a certain part of the system. We show that the strong connectivity property of the network topology guarantees that the complex behavior is global and manifested by all the agents in the network, even though the source of uncertainty is localized. This work is the first, to the best of our knowledge, to establish the intimate relationship between the propagation of channel uncertainties in networked systems, the MS stability robustness and the emergence of Lévy flights in distributed averaging systems. As averaging is central to science and engineering, the results of the paper may have far-reaching consequences on the understanding and engineering of complex networked systems.

Published in:

Automatic Control, IEEE Transactions on  (Volume:57 ,  Issue: 10 )