Heider balance on Archimedean lattices and cliques

Abstract

We investigate the work function $U(T)$ for the Heider balance, driven by a thermal noise $T$, on several planar networks that contain separated triangles, pairs of triangles, chains of triangles and complex structures of triangles. In simulations, the heat-bath algorithm is applied. Two schemes of link values updating are considered: synchronous and asynchronous (sequential). The latter results are compared with analytical calculations for small cliques. We argue that the actual shape of $U(T)$ is a consequence of a local topology rather than of a macroscopic ordering. Finally, we present the mathematical proof that for any planar lattice, perfect structural (Heider) balance is unreachable at $T>0$.

12 pages, 14 figures

References in corpus (9)

• Dynamics of Social Balance on Networks
• Mean-field solution of structural balance dynamics in nonzero temperature
• Testing structural balance theories in heterogeneous signed networks
• Towards the Heider balance with a cellular automaton
• Hybrid balance theory: Heider balance under higher order interactions
• Thermal properties of structurally balanced systems on diluted and densified triangulations
• Thermal properties of structurally balanced systems on classical random graphs
• Modified Heider Balance on Sparse Random Networks
• Exact cluster dynamics of indirect reciprocity in complete graphs