Phase transitions on fixed connected graphs and random graphs in the presence of noise

Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M. Olson, Haifeng Liu, Nicola Elia

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

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

Original languageEnglish (US)
Pages (from-to)1817-1825
Number of pages9
JournalIEEE Transactions on Automatic Control
Volume53
Issue number8
DOIs
StatePublished - Sep 17 2008
Externally publishedYes

Keywords

  • Consensus
  • Limited communication
  • Networked dynamical systems
  • Phase transitions
  • Random graphs

Fingerprint Dive into the research topics of 'Phase transitions on fixed connected graphs and random graphs in the presence of noise'. Together they form a unique fingerprint.

Cite this