Social search in "Small-World" experiments

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. Although theoretically plausible, empirical evidence for the hypothesis is limited, as most chains in "small-world" experiments fail to complete, thereby biasing estimates of "true" chain lengths. Using data from two recent small-world experiments, comprising a total of 162,328 message chains, and directed at one of 30 "targets" spread across 19 countries, we model heterogeneity in chain attrition rates as a function of individual attributes. We then introduce a rigorous way of estimating true chain lengths that is provably unbiased, and can account for empiricallyobserved 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 in 6-7 steps--...

• Type: Conference
• Year: 2009
• Where: WWW
• Authors: Sharad Goel, Roby Muhamad, Duncan J. Watts
• Keywords: Algorithmic Small-world Hypothesis, Chain Attrition Rates, Internet Technology, True Chain Lengths, WWW 2009