Social Balance & Transitivity

Slides:



Advertisements
Similar presentations
Diffuse Musings James Moody Duke University, Sociology Duke Network Analysis Center SAMSI Complex Networks Workshop Aug/Sep.
Advertisements

Network Matrix and Graph. Network Size Network size – a number of actors (nodes) in a network, usually denoted as k or n Size is critical for the structure.
Where we are Node level metrics Group level metrics Visualization
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Positive and Negative Relationships Chapter 5, from D. Easley and J. Kleinberg book.
The Statistical Analysis of the Dynamics of Networks and Behaviour. An Introduction to the Actor-based Approach. Christian Steglich and Tom Snijders ——————
Dynamic Social Balance James Moody Ohio State University Freeman Award Presentation Sunbelt Social Network Conference, February 2005.
Selected Topics in Data Networking
Statistics II: An Overview of Statistics. Outline for Statistics II Lecture: SPSS Syntax – Some examples. Normal Distribution Curve. Sampling Distribution.
Statistics 350 Lecture 14. Today Last Day: Matrix results and Chapter 5 Today: More matrix results and Chapter 5 Please read Chapter 5.
The Simple Regression Model
Attitudes of Cognitive Organization Fritz Heider (1946) The Journal of Psychology, 21,
Sunbelt 2009statnet Development Team ERGM introduction 1 Exponential Random Graph Models Statnet Development Team Mark Handcock (UW) Martina.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Connectivity and the Small World Overview Background: de Pool and Kochen: Random & Biased networks Rapoport’s work on diffusion Travers and Milgram Argument.
Connectivity and the Small World Overview Background: de Pool and Kochen: Random & Biased networks Rapoport’s work on diffusion Travers and Milgram Argument.
1 1 Slide © 2007 Thomson South-Western. All Rights Reserved.
Social Balance & Hierarchy Overview Background: Basic Balance Theory Extensions to directed graphs Triads Theoretical Implications: Micro foundations of.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Digital Image Processing Lecture 25: Object Recognition Prof. Charlene Tsai.
Single-Factor Studies KNNL – Chapter 16. Single-Factor Models Independent Variable can be qualitative or quantitative If Quantitative, we typically assume.
Time and Social Networks Background: Most social network research has been static, though there is a growing interest in modeling network dynamics. This.
Time and Social Networks Background: Most social network research has been static, though there is a growing interest in modeling network dynamics. This.
Comparing Snapshots of Networks Shah Jamal Alam and Ruth Meyer Centre for Policy Modelling 28 th March, 2007 – CAVES Bi-annual Meeting, IIASA,
Hierarchy Overview Background: Hierarchy surrounds us: what is it? Micro foundations of social stratification Ivan Chase: Structure from process Action.
Graphs & Matrices Todd Cromedy & Bruce Nicometo March 30, 2004.
Lecture 2: Statistical learning primer for biologists
Introduction to Statistical Models for longitudinal network data Stochastic actor-based models Kayo Fujimoto, Ph.D.
11 Network Level Indicators Bird’s eye view of network Image matrix example of network level Many network level measures Some would argue this is the most.
Network Science K. Borner A.Vespignani S. Wasserman.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
DATA STRUCTURES AND LONGITUDINAL DATA ANALYSIS Nidhi Kohli, Ph.D. Quantitative Methods in Education (QME) Department of Educational Psychology 1.
Comparing Counts Chi Square Tests Independence.
An Introduction to Stochastic Actor-Oriented Models (aka SIENA)
Connectivity and the Small World
Business and Economics 6th Edition
Social Networks Analysis
Measuring Partial Balance in Signed Networks
Correlation – Regression
Department of Computer and IT Engineering University of Kurdistan
CHAPTER 11 Inference for Distributions of Categorical Data
CJT 765: Structural Equation Modeling
Chapter 25 Comparing Counts.
Of Probability & Information Theory
Hypothesis Testing: Hypotheses
Agent-Based Methods for Dynamic Social Networks
Networks with Signed Edges
Propagating Uncertainty In POMDP Value Iteration with Gaussian Process
CHAPTER 29: Multiple Regression*
Single-Factor Studies
Single-Factor Studies
+ – If we look at any two people in the group in isolation,
CHAPTER 11 Inference for Distributions of Categorical Data
Social Balance & Transitivity
Modeling Peer Influence
Review of Chapter 3 Examining Relationships
CHAPTER 11 Inference for Distributions of Categorical Data
Chapter 26 Comparing Counts.
Statistics II: An Overview of Statistics
CHAPTER 11 Inference for Distributions of Categorical Data
CHAPTER 11 Inference for Distributions of Categorical Data
CHAPTER 11 Inference for Distributions of Categorical Data
Chapter 26 Comparing Counts Copyright © 2009 Pearson Education, Inc.
CHAPTER 11 Inference for Distributions of Categorical Data
CHAPTER 11 Inference for Distributions of Categorical Data
Chapter 26 Comparing Counts.
CHAPTER 11 Inference for Distributions of Categorical Data
CHAPTER 11 Inference for Distributions of Categorical Data
Business and Economics 7th Edition
Review of Chapter 3 Examining Relationships
Longitudinal Social Network Data
Presentation transcript:

Social Balance & Transitivity Overview Background: Basic Balance Theory Extensions to directed graphs Basic Elements: Affect P -- O -- X Triads and Triplets Among Actors Among actors and Objects Theoretical Implications: Micro foundations of macro structure Implications for networks dynamics

Geographic history of an email petition. Petition to save NPR, Jan ‘01

Social Balance & Transitivity Heider’s work on cognition of social situations, which can be boiled down to the relations among three ‘actors’: Object X P O Other Person Heider was interested in the correspondence of P and O, given their beliefs about X

Social Balance & Transitivity Each dyad (PO, PX, OX) can take on one of two values: + or - Two Relations: 8 POX triples: + p o x x x x Like: - - - - + + + o p o p o p + - - x x Dislike + - + - - p o p o - + x x - + - + p o p o - +

Social Balance & Transitivity The 8 triples can be reduced if we ignore the distinction between POX: x x x x - + + - - + + - p o p o p o p o + + - - x x + - + - p o p o - + x x - + - + p o p o - + - - + + - - + + + + - -

Social Balance & Transitivity We determine balance based on the product of the edges: + “A friend of a friend is a friend” (+)(+)(+) = (+) Balanced - - “An enemy of my enemy is a friend” (-)(+)(-) = (-) Balanced + - - (-)(-)(-) = (-) Unbalanced “An enemy of my enemy is an enemy” - “A Friend of a Friend is an enemy” + + (+)(-)(+) = (-) Unbalanced -

Social Balance & Transitivity Heider argued that unbalanced triads would be unstable: They should transform toward balance + + Become Friends + + - + + Become Enemies - - - + Become Enemies -

Social Balance & Transitivity IF such a balancing process were active throughout the graph, all intransitive triads would be eliminated from the network. This would result in one of two possible graphs (Balance Theorem): Complete Clique Balanced Opposition Friends with Enemies with

Social Balance & Transitivity Empirically, we often find that graphs break up into more than two groups. What does this imply for balance theory? It turns out, that if you allow all negative triads, you can get a graph with many clusters. That is, instead of treating (-)(-)(-) as an forbidden triad, treat it as allowed. This implies that the micro rule is different: negative ties among enemies are not as motivating as positive ties.

Social Balance & Transitivity Empirically, we also rarely have symmetric relations (at least on affect) thus we need to identify balance in undirected relations. Directed dyads can be in one of three states: 1) Mutual 2) Asymmetric 3) Null Every triad is composed of 3 dyads, and we can identify triads based on the number of each type, called the MAN label system

Social Balance & Transitivity Balance in directed relations Actors seek out transitive relations, and avoid intransitive relations. A triple is transitive If: i j & j k then: i k A property of triples within triads Assumes directed relations The saliency of a triad may differ for each actor, depending on their position within the triad.

Social Balance & Transitivity Once we admit directed relations, we need to decompose triads into their constituent triples. Ordered Triples: a b c; a c Transitive b a c b; a b Vacuous b a c; b c a c Vacuous b c a; b a 120C Intransitive c a b; c b Intransitive c b a; c a Vacuous

Network Sub-Structure: Triads (0) (1) (2) (3) (4) (5) (6) 003 012 102 111D 201 210 300 021D 111U 120D Intransitive Transitive 021U 030T 120U Mixed 021C 030C 120C

An Example of the triad census Type Number of triads --------------------------------------- 1 - 003 21 2 - 012 26 3 - 102 11 4 - 021D 1 5 - 021U 5 6 - 021C 3 7 - 111D 2 8 - 111U 5 9 - 030T 3 10 - 030C 1 11 - 201 1 12 - 120D 1 13 - 120U 1 14 - 120C 1 15 - 210 1 16 - 300 1 Sum (2 - 16): 63

Social Balance & Transitivity As with undirected graphs, you can use the type of triads allowed to characterize the total graph. But now the potential patterns are much more diverse 1) All triads are 030T: A perfect linear hierarchy.

Social Balance & Transitivity Triads allowed: {300, 102} N* M M 1 1

Social Balance & Transitivity Cluster Structure, allows triads: {003, 300, 102} N* Eugene Johnsen (1985, 1986) specifies a number of structures that result from various triad configurations M M N* N* N* 1 N* M M

Social Balance & Transitivity PRC{300,102, 003, 120D, 120U, 030T, 021D, 021U} Ranked Cluster: M N* A* 1 1 1 1 1 1 1 1 1 1 1 1 1 And many more...

Social Balance & Transitivity Substantively, specifying a set of triads defines a behavioral mechanism, and we can use the distribution of triads in a network to test whether the hypothesized mechanism is active. We do this by (1) counting the number of each triad type in a given network and (2) comparing it to the expected number, given some random distribution of ties in the network. See Wasserman and Faust, Chapter 14 for computation details, and the SPAN manual for SAS code that will generate these distributions, if you so choose.

Social Balance & Transitivity Triad: 003 012 102 021D 021U 021C 111D 111U 030T 030C 201 120D 120U 120C 210 300 BA Triad Micro-Models: BA: Ballance (Cartwright and Harary, ‘56) CL: Clustering Model (Davis. ‘67) RC: Ranked Cluster (Davis & Leinhardt, ‘72) R2C: Ranked 2-Clusters (Johnsen, ‘85) TR: Transitivity (Davis and Leinhardt, ‘71) HC: Hierarchical Cliques (Johnsen, ‘85) 39+: Model that fits D&L’s 742 mats N :39-72 p1-p4: Johnsen, 1986. Process Agreement Models. CL RC R2C TR HC 39+ p1 p2 p3 p4

Social Balance & Transitivity Structural Indices based on the distribution of triads The observed distribution of triads can be fit to the hypothesized structures using weighting vectors for each type of triad. Where: l = 16 element weighting vector for the triad types T = the observed triad census mT= the expected value of T ST = the variance-covariance matrix for T

Standardized Difference from Expected Triad Census Distributions Standardized Difference from Expected Data from Add Health 400 300 200 t-value 100 -100 012 102 021D 021U 021C 111D 111U 030T 030C 201 120D 120U 120C 210 300

Social Balance & Transitivity For the Add Health data, the observed distribution of the tau statistic for various models was: Indicating that a ranked-cluster model fits the best.

Testing Theories of Friendship Standardized Coefficients from an Exponential Random Graph Model 0.8 0.6 0.4 0.2 -0.2 -0.4 -0.6 SES GPA Fight College Transitivity Same Sex Drinking Intransitivity Same Grade Same Clubs Same Race Both Smoke Reciprocity

Social Balance & Transitivity So far, we’ve focused on the graph ‘at equilibrium.’ That is, we have hypothesized structures once people have made all the choices they are going to make. What we have not done, is really look closely at the implication of changing relations. That is, we might say that triad 030C should not occur, but what would a change in this triad imply from the standpoint of the actor making a relational change?

Social Balance & Transitivity 003 102 021D 021U 030C 111D 111U 030T 201 120D 120U 120C 210 300 012 021C vacuous transition Increases # transitive Vacuous triad Intransitive triad Transitive triad Decreases # intransitive Decreases # transitive Increases # intransitive

Social Balance & Transitivity

Social Balance & Transitivity Random Walk TRIAD 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 100 200 300

Social Balance & Transitivity Transitive = .5, Intran & Pos = 0. TRIAD 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ITTER 100 200 300

Social Balance & Transitivity TRIAD 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ITTER 100 200 300

Social Balance & Transitivity Strong Negative (INT=-2) TRIAD 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ITTER 100 200 300

Social Balance & Transitivity Observed triad transition patterns, from Hallinan’s data. 003 102 021D 030T 201 120U 120C 210 300 012 021C 021U 111D 111U 030C 120D

Social Balance & Transitivity Strong Transitivity Simulation Density Transitivity

Social Balance & Transitivity Strong Intransitivity Simulation

Social Balance & Transitivity Strong Intransitivity Simulation Ideal-typical results

Social Balance & Transitivity Moderate values on both Simulation

Social Balance & Transitivity

Social Balance & Transitivity

Social Balance & Transitivity A Brief History of Balance Through Time Newcomb, PI layout

Social Balance & Transitivity A Brief History of Balance Through Time Newcomb, PI layout

Social Balance & Transitivity A Brief History of Balance Through Time