Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise

In this paper, we study the phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a group of non-mobile agents form either a fixed connected graph or a random graph process, and each agent, taking bipolar value either +1 or -1, updates its value according to its previous value and the noisy measurements of the values of the agents connected to it. We present proofs for the occurrence of the following phase transition behavior: At a noise level higher than some threshold, the system generates symmetric behavior (vapor or melt of magnetization) or disagreement; whereas at a noise level lower than the threshold, the system exhibits spontaneous symmetry breaking (solid or magnetization) or consensus. The threshold is found analytically. The phase transition occurs for any dimension. Finally, we demonstrate the phase transition behavior and all analytic results using simulations. This result may be found useful in the study of the collective behavior of complex systems under communication constraints.

[1]  Nicola Elia,et al.  When bode meets shannon: control-oriented feedback communication schemes , 2004, IEEE Transactions on Automatic Control.

[2]  R. Olfati-Saber.  Ultrafast consensus in small-world networks , 2005, Proceedings of the 2005, American Control Conference, 2005..

[3]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[4]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[5]  Christopher G. Langton,et al.  Computation at the edge of chaos: Phase transitions and emergent computation , 1990 .

[6]  George J. Pappas,et al.  Stable flocking of mobile agents part I: dynamic topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[8]  Nigel J. Newton,et al.  Information and Entropy Flow in the Kalman–Bucy Filter , 2005 .

[9]  Sekhar Tatikonda,et al.  Control under communication constraints , 2004, IEEE Transactions on Automatic Control.

[10]  B. Cipra.  An introduction to the Ising model , 1987 .

[11]  A. Barabasi,et al.  Collective Motion of Self-Propelled Particles: Kinetic Phase Transition in One Dimension , 1997, cond-mat/9712154.

[12]  R. Murray,et al.  Consensus protocols for networks of dynamic agents , 2003, Proceedings of the 2003 American Control Conference, 2003..

[13]  L. Goddard.  Information Theory , 1962, Nature.

[14]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[15]  Heinz Mühlenbein,et al.  Frequency Dependent Invasion in a Spatial Environment , 2003 .

[16]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[17]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[18]  A. Mogilner,et al.  Spatio-angular order in populations of self-aligning objects: formation of oriented patches , 1996 .

[19]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[20]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[21]  Barry Cipra.  Statistical Physicists Phase Out a Dream , 2000, Science.

[22]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[23]  Sanjoy K. Mitter,et al.  Control with Limited Information , 2001, Eur. J. Control.

[24]  Jialing Liu,et al.  Fundamental limits in Gaussian channels with feedback: confluence of communication, estimation, and control , 2006 .

[25]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[26]  V. Rich.  Personal communication , 1989, Nature.

[27]  B. Bollobás.  The evolution of random graphs , 1984 .

[28]  M. Mesbahi,et al.  Agreement in presence of noise: pseudogradients on random geometric networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[29]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[30]  D. Julian.  Erasure networks , 2002, Proceedings IEEE International Symposium on Information Theory,.

[31]  George J. Pappas,et al.  Stable flocking of mobile agents, part I: fixed topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[32]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[33]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[34]  W. Rappel,et al.  Self-organization in systems of self-propelled particles. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Anant Sahai,et al.  Anytime information theory , 2001 .