Random talk: Random walk and synchronizability in a moving neighborhood network

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 finite 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 (talkmg) is possible only for geographically neighboring agents. This 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 a 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 quickly in the lattice. (c) 2006 Elsevier B.V. All rights reserved.