pith. sign in

arxiv: cond-mat/0506476 · v1 · submitted 2005-06-19 · ❄️ cond-mat.stat-mech · nlin.AO

Dynamics of Social Balance on Networks

classification ❄️ cond-mat.stat-mech nlin.AO
keywords networkdynamicsimbalancedlinksstatebalancedfriendlynetworks
0
0 comments X
read the original abstract

We study the evolution of social networks that contain both friendly and unfriendly pairwise links between individual nodes. The network is endowed with dynamics in which the sense of a link in an imbalanced triad--a triangular loop with 1 or 3 unfriendly links--is reversed to make the triad balanced. With this dynamics, an infinite network undergoes a dynamic phase transition from a steady state to "paradise"--all links are friendly--as the propensity p for friendly links in an update event passes through 1/2. A finite network always falls into a socially-balanced absorbing state where no imbalanced triads remain. If the additional constraint that the number of imbalanced triads in the network does not increase in an update is imposed, then the network quickly reaches a balanced final state.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.