1 / 4

Structural balance

Structural balance. Positive and negative relationships. (a), (c) are balanced. Balanced complete graph.

Antony
Télécharger la présentation

Structural balance

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Structural balance

  2. Positive and negative relationships • (a), (c) arebalanced

  3. Balanced complete graph • Specifically, we say that a labeled complete graph is balancedifevery one of its triangles is balanced — that is, if it obeys Structural Balance Property: For every set of three nodes, either all three edges are labeled +, or exactly one edge is labeled +

  4. Balance Theorem • If a labeled complete graph is balanced, then either all pairs of nodes are friends, or else the nodes can be divided into two groups X and Y such that every pair of nodes in X like each other, every pair of nodes in Y like each other, and everyone in X hates everyone in Y

More Related