1. Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar

2. Social Network Analysis [Social network analysis] is grounded in the observation that social actors are interdependent and that the links among them have important consequences for every individual [and for all of the individuals together].... [Relationships] provide individuals with opportunities and, at the same time, potential constraints on their behavior.... Social network analysis involves theorizing, model building and empirical research focused on uncovering the patterning of links among actors. It is concerned also with uncovering the antecedents and consequences of recurrent patterns. [Linton C. Freeman, UC-Irvine]

3. Representing a Social Network 12345678 a set V of n nodes or vertices, usually denoted {v 1, …, v n } a set E of m edges between nodes, usually denoted {e i,j } 83 edge e 8,3 node v 2

4. Examples of Social Networks Nodes are high-school students. Boys are red, Girls are blue… What is the meaning of a bidirectional edge?

5. Paths 12837 456 Definition: A path is a sequence of nodes (v 1, …, v k ) such that for any adjacent pair v i and v i+1, there’s a directed edge e i,i+1 between them. Path (v 1,v 2,v 8,v 3,v 7 )

6. Path length 12837 456 Definition: The length of a path is the number of edges it contains. Path (v 1,v 2,v 8,v 3,v 7 ) has length 4.

7. Distance 128374 56 Definition: The distance between nodes v i and v j is the length of the shortest path connecting them. The distance between v 1 and v 7 is 3.

8. Famous distances nodes = {actors} edges = if two actors star in same film Kevin Bacon number = distance between actor and Bacon Kevin Bacon number

9. The Kevin Bacon Game Invented by Albright College students in 1994: Craig Fass, Brian Turtle, Mike Ginelly Goal: Connect any actor to Kevin Bacon, by linking actors who have acted in the same movie. Oracle of Bacon website uses Internet Movie Database (IMDB.com) to find shortest link between any two actors: http://oracleofbacon.org/

10. Famous distances Math PhD genealogies

11. Famous distances nodes = {mathematicians} edges = if 2 mathematicians co-author a paper Erd ő s number = distance between mathematican and Erdos Paul Erd ő s number

12. Erdős Numbers Erd ő s wrote 1500+ papers with 507 co-authors. Number of links required to connect scholars to Erd ő s, via co- authorship of papers What type of graph do you expect? Jerry Grossman (Oakland Univ.) website allows mathematicians to compute their Erd ő s numbers: http://www.oakland.edu/enp/ http://www.oakland.edu/enp/ Connecting path lengths, among mathematicians only: avg = 4.65 max = 13

13. Diameter 128374 56 Definition: The diameter of a graph is the maximum shortest-path distance between any two nodes. The diameter is 3.

14. Six degrees of separation The diameter of a social network is typically small.

15. Milgram: Six Degrees of Separation 296 People in Omaha, NE, were given a letter, asked to try to reach a stockbroker in Sharon, MA, via personal acquaintances 20% reached target average number of “hops” in the completed chains = 6.5 Why are chains so short? “Random Graphs have small diameter” Do they?

16. Why are Chains so Short? Maybe exponential growth of acquaintances… @d=1: Most people know at least 100 others @d=2: Through their friends: 10K @d=3: Through their friends’ friends: 1M @d=4: Through their friends’ friends’ friends: 100M @d=k: 10^k

17. Not so fast… Your friends mostly know each other… In high school self-reported friendships, clusters based on race (left-right) and age (top-bottom) Homophily: Your friends are similar to you! Pr [two of your friends are friends] is high Social networks have vertices with high clustering coefficient (how much its neighborhood resembles a clique) So, exponential growth does not explain it We want a model with small diameter and large clustering coefficient

18. Watts/Strogatz: Rewire Ring Lattice Proposed a model (ring lattice) with small diameter and large clustering coefficient: Put people on circle connect each to x closest neighbors; with prob. p, rewire each connection randomly Result: Yes, short chains exist for p>0.1! p =0.0 p =0.1 p =1.0

19. Ok, short chains exist, but… Will people be able to find the short chains? Milgram showed that people were able to find them. Kleinberg [2000]: No search strategy in a Watts/Strogatz network, based only on local information, can find short chains…

20. Kleinberg’s Rewire Grid

21. Now you can find short paths!

22. The effect of distance Searching with local information gets more efficient as  increases up to 2, then gets worse again! In fact, it finds short paths in logarithmic time! Theory and practice agree!

23. Translated into English? “Distance scales” Count friends within log distances: 1 - 10 10 - 100 100 - 1000 1000 - 10000 … When  = 2, nodes have the same volume of links to each distance scale

24. The Power of Long Distance Relations Probability of friendship is falling off like the square of the distance! Geographic location is a primary reason for selecting next person in chain We have eventually understood Milgram’s experiment But does this explains what happens on the internet? (It depends on how you define distance: see Liben-Nowell’s paper)