The dynamics of triadic opinion formation models

Gabriel Istrate Center for the Study of Complexity, Babe-Bolyai University, Cluj, Romania [also e-Austria Research Institute, Timioara, Romania] email: gabrielistrate@acm.org

June 16, 2011

csc-logo

What are opinion formation models

Discrete dynamical systems on graphs. (Fairly loosely) based on sociological theories and models. C. Castellano, S. Fortunato and V. Loreto  Statistical physics of social dynamics, Reviews of modern physics, 81(2): 591646, 2009. Models I present: dierent, hope you will nd interesting Perspective: Theoretical Computer Science. Room for Stat. Phys Methods. Models specied by discrete Markov chains How many steps until mixing/absorbtion ? How does mixing time depend on network structure ?

csc-logo

Triadic ?

Fritz Heider "The Psychology of Interpersonal Relations", Wiley 1958. Complete graph. Edges labeled plus or minus one (friend/enemy). Imbalanced triangle: odd number of minuses. System "tends to eliminate imbalance". Completely balanced states: two factions

B:

plus one. Between

A and B :

A and B .

Within

A,

minus one.

csc-logo

East European Politics & Criminal Gangs

Social balance: part of political dynamics Other (somewhat dierent) example: criminal gangs in L.A (Redner). Leskovec et al: social balance observed in Wikipedia data (status-based model better t).

csc-logo

The last question not (quite) the right one to ask

Dynamics the same on any graph having the same structure of triangles ! Example: triadic star. take 18 regular polygon. Split it into 18 triangles by connecting vertices with center.

csc-logo

Triadic dual of graph G

Undirected hypergraph with self-loops 1. 2.

T3 (G ) = (V 3 , E 3 ).

3.

V 3 is the set of triangles of G . Hyperedges in T3 (G ) correspond to edges in G and connect all vertices v V 3 containing a given edge. In particular self-loop to vertex e V 3 if e belongs to an unique triangle of G .

csc-logo

Outline

Motivation and Goals. Dynamics of social balance 3-person Prisoners' Dilemma Game with Pavlov dynamics..

csc-logo

Model
Antl, Krapivsky and Redner (Physica D, 2006). Complete graph

Kn .

Edges labeled

1.

Unbalanced triangle: odd number of minuses. Choose a random imbalanced triangle and balance it by

T has a single negative edge e : With probability p turn e to positive. With probability 1 p turn one of the other two edges of T to negative. Kn : Phase transition at p = 1/2.
Important case: If the triangle Triangular lattice: experimental work (Raddichi et al., Phys. Rev. E, 2006). Related to XOR-SAT problem. What about other networks ?
csc-logo

ipping one of its edges.

Previous results

OBSERVATION: Edges not in a triad don't matter. Assume:

connected, every edge part of at least one triangle.

Reachability: is state Recurrence:

S2 reachable from S1 ? will state S1 always be reachable in the future ?

Random triangle: Convergence time ? (mixing time as a Markov chain). How does the convergence time depend on the network structure ?

csc-logo

Reduction: Duality (II)

t , a particle on t T3 (G ). e
that

For each imbalanced triangle Reinterpret dynamics !

Choose a random particle and random hyperedge contains it. MOVE: put particles on vertices of Delete particles from vertices of If

T3 (G ) graph:

that don't have one.

that have one.

well-known interacting particle system

(annihilating random walk).

csc-logo

Theorem: recurrent states when T3 (G ) is a graph (with cycles)

Let G be a graph such that T3 (G ) is a connected graph, and let s0 : E (G ) {1} be an initial state. Then: T3 (G ): no loops and # of imbalanced triangles in s0 is odd then recurrent = states containing exactly one imbalanced triangle.Else recurrent PROOF: 1. Particles disappear in pairs, initially odd number. 2. Particles disappear in pairs, initially even number, or single edge

reachable completely balanced states.

"particle annihilator".

csc-logo

Convergence time for triadic cycle

DEFINITION: initial state

Ts (G ) is the time for the system, starting from

SB (G ) = max{E [Ts (G )]}. s

to enter a state with zero (one) imbalanced triangles.

SB (G ):

THEOREM: Let PROOF:

p = min{p, 1/2}. n the triadic cycle Tn is O ( ) p

the time to social balance of graph

G.

The time to social balance on

The number of particles does not increase. At each step it goes down by one with probability at least

p .
csc-logo

Time to social balance: T3 (G ) graph

Bound time using two measures of graph Denition[Aldous] Let

T3 (G ) G.
The

G is dened as M (G ) = maxi ,j E [TM |X0 = i , Y0 = j ], where TM = min{k : Xk = Yk }. Denition [Aldous-Fill] Let G = (V , E ) be a graph. The Cheeger time of graph G is
worst case meeting time of

(Xn ), (Yn )

be independent r.w. on

c (G ) =
where

AV

sup

[A] [A] , i A j A [i ]pi ,j

[A] = |A| n

and

pi ,j = 1/deg (i ) i i j , 0 otherwise.
csc-logo

Time to social balance: T3 (G ) graph

THEOREM: For any graph there exists satises

such that

T3 (G ) is a connected loopless

>0

such that the time to social balance on

M (T3 (G )) SB (G ) C nmin{3,2+log2 (C (T3 (G ))}

Notes: Open problem in [Aldous-Fill]: implies that upper and lower bound same order of magnitude in

(1)

N.

Triangular lattice: Raddichi et al. experimentally

SB N 2.25... .

This result:

O (N 3 ).

Don't know how to

compute Cheeger time of triangular lattice.

csc-logo

Harder case: general hypergraph

This case: no mixing time, only reachability/recurrence. Dierent view: solitare game Lights out , actually sold and widely studied in combinatorics. Sandpile-like generalization: Vertices of hypergraph contain 0 to

p 1 particles.

Step: take particle from one vertex, add to all neighbors in a hyperedge.

p particles collectively annihilate.

csc-logo

Harder case: general hypergraph

For each edge/vertex pair: boolean variable of times edge

ze ,v , the number

appears in path.

CONCLUSION: If

s2 reachable from s1 then system s2 (v ) s1 (v ) =

v e

xe

v V

has a solution (

ze ).

csc-logo

Reachability
Linear system: necessary condition for reachability. Sucient ? NO. Problem with converse statement: Only hyperedges containing at least a particle are allowed to switch. E.g.

G =triangle. s1 = [000], s2 = [111]. H

be a hypergraph with no graph edges (not

The only obstruction ! THEOREM: Let

necessarily connected). Assume that

w1 , w2 ZV (H ) are p congurations such that for no connected component C of H , w1 |C 0, w2 |C 0. Then state w2 is reachable from w1 if and only if system of equations H (w1 , w2 ) has a solution in Zp .
Easily solves recurrence as well !
csc-logo

The (tradic) Prisoners' Dilemma Game with Pavlov dynamics

Labels on the vertices of a (connected) 2-d simplex Each label 0 or 1.

G.

a, b , c . Replace all labels by = 0 i a = b = c , = 1 otherwise.

Choose random triangle, labels Story: higher-dimensional version of a system I studied before

(a, b) (a b, a b).

3-player Prisoners' Dilemma (Lindgren et al.) with Pavlov (win-stay lose shift) dynamics.

n = 3: 0 < T < 1 < P < 2. C1 = 0, C2 = 1/2, C3 = 1, D0 = P , D1 = P +T , D2 = T . max{ 1 , P } < < min{1, P +T } 2 2 2

The system will eventually hit all zeros state. ... In how many steps ?
csc-logo

Convergence time: rigorous results

So far similar results somewhat similar to the 1-d case (but more involved) Exponential on graph

Kn . O (n log n) on triadic cycle Cn .

Mossel and Roch (2007, 1-d): graph is hard to break into two sparsely connected parts: exponential. Works for 2-d hard-to break: (Dierent) Cheeger constant !

S =players playing zero, S =players playing one.

2-d: triangles with two vertices in

Cheeger constant: fraction of edges going across a cut

(S , S ).

Many edges

connect 1 to 0, driving dynamics away from zero.

S , one in S .

csc-logo

Recent Developments

Dyer and Velumailum (1-d cycle): in [1 1] don't always go to [0 0]. Instead each player goes to 0 independently with probability

p > 0.8696: p < 0.3199:

triadic cycle:

convergence time

O (n log n). p0 ?

p.

convergence time exponential.

Phase transition ? At what critical value

O (log n) close enough to one.

Phase transition:

problem for physicists !

csc-logo

Conclusions

The model of AKR is related to a hypergraph generalization of annihilating random walks. Convergence time: determined by a parameter related to Cheeger constant/expansion.. Lots of work still to be done ! www.complexity2011.org Coping with Complexity, small workshop in Cluj-Napoca (19-20 October). Free registration. Everyone is invited.

csc-logo