1 / 36

Social Networks 101

Social Networks 101. Prof. Jason Hartline and Prof. Nicole Immorlica. Lecture Six : The mathematics of decentralized search. Small world phenomenon. Milgram’s experiment (1960s ).

dacey
Download Presentation

Social Networks 101

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. Social Networks 101 Prof. Jason Hartline and Prof. Nicole Immorlica

  2. Lecture Six: The mathematics of decentralized search

  3. Small world phenomenon Milgram’sexperiment (1960s). Ask someone to pass a letter to another person via friends knowing only the name, address, and occupation of the target.

  4. How to route Problem. How can I get this message from me to the far-away target? Solution. Pass message to a friend. (sub) closer

  5. Time for Math Corner

  6. Scales of resolution Each new scale doubles distance from the center.

  7. Long-range links Suppose each person has a long-range friend in each scale of resolution.

  8. How to route Algorithm. Pass the message to your farthest friend that is to the left of the target.

  9. Trace of route

  10. Analysis new dist. 1 2 4 2j 2j+1 old dist.

  11. Distance is cut in half every step!

  12. Analysis • Original distance is ? • Distance is cut in half every step (at least). • Number of steps is ? at most n. at most log n.

  13. And in real life …

  14. Strength of weak ties Long-range links are often casual acquaintances, … but are very important for search and other network phenomena

  15. Where do the best job leads come from: your close friends or your acquaintances?

  16. Job search Granovetter: Most people learn about jobs through personal friends, who are mere acquaintances!

  17. Weak ties Idea. Weak ties are likely to link distant parts of the network and so are particularly well-suited to information flow.

  18. Social network structure Which is more likely?

  19. How will this network evolve?

  20. Triadic Closure: If two nodes have common neighbor, there is an increased likelihood that an edge between them forms.

  21. Explaining triadic closure • Opportunity. If you spend a lot of time with your best friend and your girlfriend, there is an increased chance they will meet.

  22. Explaining triadic closure 2. Incentive. If your best friend hates your girlfriend, it stresses both relationships.

  23. Explaining triadic closure 3.Homophily. If you have things in common with both your best friend and your girlfriend, they have things in common too.

  24. Does this happen in real graphs?

  25. Definition: The clustering coefficient of a node v is the fraction of pairs of v’s friends that are connected to each other by edges. Clustering Coefficient = 1/2 The higher the clustering coefficient of a node, the more strongly triadic closure is acting on it

  26. Collaboration graph Clustering coefficient = 0.14 Density of edges = 0.000008

  27. Bridges An edge is a bridge if deleting it would cause its endpoints to lie in different components

  28. Local bridges An edge is a local bridge if its endpoints have no common friends

  29. Weak Versus Strong Ties

  30. Definition: Node v satisfies the Strong Triadic Closure if, for any two nodes u and w to which it has strong ties, there is an edge between u and w (which can be either weak or strong) This graph satisfies the strong triadic closure

  31. Claim: If node v satisfies the Strong Triadic Closure and is involved in at least two strong ties, then any local bridge it is involved in must be a weak tie Argument “by contradiction”: Suppose edge v-u is a local bridge and it is a strong tie w Then u-w must exist because of Strong Triadic Closure u v But then v-u is not a bridge

  32. Conclusion Local bridges are necessarily weak ties. Structural explanation as to why job information comes from acquaintances.

  33. Next time Structural holes and balance

More Related