13-weak_ties_annot

13-weak_ties_annot -...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
CS224W: Social and Information Network Analysis re eskovec tanford University Jure Leskovec, Stanford University http://cs224w.stanford.edu
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ow information flows through the network? How information flows through the network? ow different odes n play structurally How different nodes can play structurally distinct process in roles in this process? How different links ( short range vs. long nge) play different roles in diffusion range) play different roles in diffusion? 11/1/2010 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 2
Background image of page 2
[Granovetter ‘73] ow people find out about new jobs? How people find out about new jobs? Mark Granovetter, part of his PhD in 1960s People find the information through personal contacts But: Contacts were often acquaintances rather an close friends than close friends This is surprising: One would expect your friends to help you out more than casual acquaintances when you are between the jobs Why is it that distance acquaintances are most helpful? 11/1/2010 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
[Granovetter ‘73] o perspectives on iendships: Two perspectives on friendships: Structural: iendships span different portions of the network Friendships span different portions of the network Interpersonal: iendship between two people is either strong or weak Friendship between two people is either strong or weak 11/1/2010 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 4
Background image of page 4
hich edge is more likely A or A ? Which edge is more likely A B or A D? Triadic closure: If two people in a network have a friend in common there is an increased likelihood they will become friends themselves 11/1/2010 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
iadic closure == High ustering coefficient Triadic closure High clustering coefficient Reasons for triadic closure: If B and C have a friend A in common, then: i lik l t t B is more likely to meet C (since they both spend time with A) B and C trust each other (since they have a friend in common) A has incentive to bring B and C together s it is hard for A to maintain two disjoint relationships (as it is hard for A to maintain two disjoint relationships) Empirical study by Bearman and Moody: enage girls with low clustering coefficient are more Teenage girls with low clustering coefficient are more likely to contemplate suicide 11/1/2010 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 6
Background image of page 6
dge (A B) is a ridge deleting it would Edge (A,B) is a bridge if deleting it would make A and B in be in two separate connected mponents components.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 49

13-weak_ties_annot -...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online