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

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 3 figures. To appear in the IEEE Transactions on Automatic Control

Scientific paper

10.1109/TAC.2008.929382

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-535457

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.