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

dc.creatorLiu, Jialing
dc.creatorYadav, Vikas
dc.creatorSehgal, Hullas
dc.creatorOlson, Joshua M.
dc.creatorLiu, Haifeng
dc.creatorElia, Nicola
dc.date2008-08-24
dc.date.accessioned2026-07-07T10:11:24Z
dc.date.available2026-07-07T10:11:24Z
dc.descriptionIn 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.
dc.description15 pages, 3 figures. To appear in the IEEE Transactions on Automatic Control
dc.identifierhttps://arxiv.org/abs/0808.3230
dc.identifierhttp://arxiv.org/abs/0808.3230
dc.identifierIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 53, NO. 8, 1817-1825, SEPTEMBER 2008
dc.identifierdoi:10.1109/TAC.2008.929382
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171851
dc.subjectOptimization and Control
dc.subjectInformation Theory
dc.titlePhase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
dc.typetext

Files

Collections