Stochastic synchronization over a moving neighborhood network

Maurizio Porfiri, Daniel J. Stilwell, Erik M. Bollt, Joseph D. Skufca

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We examine the synchronization problem for a group of dynamic agents that communicate via a moving neighborhood network. Each agent is modeled as a random walker in a unite lattice and is equipped with an oscillator. The communication network topology changes randomly and is dictated by the agents' locations in the lattice. Information sharing (talking) is possible only for geographically neighboring agents. The complex system is a time-varying jump nonlinear system. We introduce the concept of long-time expected communication network defined as the ergodic limit of the stochastic time-varying network. We show that if the long-time expected network supports synchronization, then so does the stochastic network when the agents diffuse sufficiently fast in the lattice.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 American Control Conference, ACC
Pages1413-1418
Number of pages6
DOIs
StatePublished - 2007
Event2007 American Control Conference, ACC - New York, NY, United States
Duration: Jul 9 2007Jul 13 2007

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2007 American Control Conference, ACC
CountryUnited States
CityNew York, NY
Period7/9/077/13/07

Keywords

  • Fast switching
  • Graph
  • Random walk
  • Stochastic stability
  • Synchronization

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Stochastic synchronization over a moving neighborhood network'. Together they form a unique fingerprint.

Cite this