Social search in "Small-World" experiments

@inproceedings{Goel2009SocialSI,
  title={Social search in "Small-World" experiments},
  author={Sharad Goel and R. Muhamad and D. Watts},
  booktitle={WWW '09},
  year={2009}
}
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals can find these paths. [...] Key Method We then introduce a rigorous way of estimating true chain lengths that is provably unbiased, and can account for empirically-observed variation in attrition rates. Our findings provide mixed support for the algorithmic hypothesis. On the one hand, it appears that roughly half of all chains can be completed…Expand
Computing a Score of Navigability in Large Graphs
Delay of Social Search on Small-World Graphs
Four degrees of separation
Using the web to do social science
  • D. Watts
  • Computer Science
  • ACM Multimedia
  • 2010
Fast and accurate link prediction in social networking systems
Mechanism Design for Finding Experts Using Locally Constructed Social Referral Web
Mechanism Design for Finding Experts Using Locally Constructed Social Referral Web
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
Search Parameters for the Small World Problem
COULD IT BE A BIG WORLD AFTER ALL? THE "SIX DEGREES OF SEPARATION" MYTH
Planetary-scale views on a large instant-messaging network
Social Capital: Its Origins and Applications in Modern Sociology
Social Capital in the Creation of Human Capital
  • J. Coleman
  • Economics
  • American Journal of Sociology
  • 1988
The Small World Problem
The small-world phenomenon: an algorithmic perspective
An Experimental Study of the Small World Problem