Stochastic synchronization over a moving neighborhood network

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

doi:10.1109/ACC.2007.4282732

Stochastic synchronization over a moving neighborhood network

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

Mechanical and Aerospace Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of the 2007 American Control Conference, ACC
Pages	1413-1418
Number of pages	6
DOIs	https://doi.org/10.1109/ACC.2007.4282732
State	Published - 2007
Event	2007 American Control Conference, ACC - New York, NY, United States Duration: Jul 9 2007 → Jul 13 2007

Publication series

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

Other

Other	2007 American Control Conference, ACC
Country/Territory	United States
City	New York, NY
Period	7/9/07 → 7/13/07

Keywords

Fast switching
Graph
Random walk
Stochastic stability
Synchronization

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/ACC.2007.4282732

Cite this

@inproceedings{8439b9e1805b47228e342a038bbabb57,

title = "Stochastic synchronization over a moving neighborhood network",

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.",

keywords = "Fast switching, Graph, Random walk, Stochastic stability, Synchronization",

author = "Maurizio Porfiri and Stilwell, {Daniel J.} and Bollt, {Erik M.} and Skufca, {Joseph D.}",

year = "2007",

doi = "10.1109/ACC.2007.4282732",

language = "English (US)",

isbn = "1424409888",

series = "Proceedings of the American Control Conference",

pages = "1413--1418",

booktitle = "Proceedings of the 2007 American Control Conference, ACC",

note = "2007 American Control Conference, ACC ; Conference date: 09-07-2007 Through 13-07-2007",

}

TY - GEN

T1 - Stochastic synchronization over a moving neighborhood network

AU - Porfiri, Maurizio

AU - Stilwell, Daniel J.

AU - Bollt, Erik M.

AU - Skufca, Joseph D.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Fast switching

KW - Graph

KW - Random walk

KW - Stochastic stability

KW - Synchronization

UR - http://www.scopus.com/inward/record.url?scp=46449112168&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46449112168&partnerID=8YFLogxK

U2 - 10.1109/ACC.2007.4282732

DO - 10.1109/ACC.2007.4282732

M3 - Conference contribution

AN - SCOPUS:46449112168

SN - 1424409888

SN - 9781424409884

T3 - Proceedings of the American Control Conference

SP - 1413

EP - 1418

BT - Proceedings of the 2007 American Control Conference, ACC

T2 - 2007 American Control Conference, ACC

Y2 - 9 July 2007 through 13 July 2007

ER -

Stochastic synchronization over a moving neighborhood network

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this