Engineering Social Networks Nicole Immorlica, Northwestern University
networks: exogenous, endogenous, … or designed?
example: designing networks to engineer diversity.
initially, a regular directed graph blue and yellow nodes
at time t, link to mR nodes at random 1. 2. link to mS nodes via color- biased searching
parameters: q, fraction of blue to yellow mR, # of random neighbors mS, # of biased neighbors
question: what is the diversity as a function of q, mR, and mS?
argo tea observations: (joint with B. Lucier and B. Rogers) steady-state diversity is independent of mS 1. 2. speed of convergence is function of mR/mS
lesson: a centralized designer can enforce diversity by insisting that people have a few random friends.
killer app #1: Schelling model of segregation
question: (joint with Kleinberg2 and Sinclair) can we decrease segregation by teaching tolerance? who should we target?
killer app #2, 3, 4, …: (half-baked) poverty traps information cascades fostering collaboration