%0 Journal Article %1 Adamic2005187 %A Adamic, Lada %A Adar, Eytan %D 2005 %J Social Networks %K decentralized experiment networks search social %N 3 %P 187 - 203 %R http://dx.doi.org/10.1016/j.socnet.2005.01.007 %T How to search a social network %U http://www.sciencedirect.com/science/article/pii/S0378873305000109 %V 27 %X We address the question of how participants in a small world experiment are able to find short paths in a social network using only local information about their immediate contacts. We simulate such experiments on a network of actual email contacts within an organization as well as on a student social networking website. On the email network we find that small world search strategies using a contact’s position in physical space or in an organizational hierarchy relative to the target can effectively be used to locate most individuals. However, we find that in the online student network, where the data is incomplete and hierarchical structures are not well defined, local search strategies are less effective. We compare our findings to recent theoretical hypotheses about underlying social structure that would enable these simple search strategies to succeed and discuss the implications to social software design.

@article{Adamic2005187, abstract = {We address the question of how participants in a small world experiment are able to find short paths in a social network using only local information about their immediate contacts. We simulate such experiments on a network of actual email contacts within an organization as well as on a student social networking website. On the email network we find that small world search strategies using a contact’s position in physical space or in an organizational hierarchy relative to the target can effectively be used to locate most individuals. However, we find that in the online student network, where the data is incomplete and hierarchical structures are not well defined, local search strategies are less effective. We compare our findings to recent theoretical hypotheses about underlying social structure that would enable these simple search strategies to succeed and discuss the implications to social software design. }, added-at = {2016-11-10T18:34:10.000+0100}, author = {Adamic, Lada and Adar, Eytan}, biburl = {https://www.bibsonomy.org/bibtex/2f27e9da85887f76be1f972f2299493a1/mbockholt}, description = {How to search a social network}, doi = {http://dx.doi.org/10.1016/j.socnet.2005.01.007}, interhash = {4732a5fbe715935be9b62a322963d8f8}, intrahash = {f27e9da85887f76be1f972f2299493a1}, issn = {0378-8733}, journal = {Social Networks }, keywords = {decentralized experiment networks search social}, number = 3, pages = {187 - 203}, timestamp = {2016-11-10T18:34:10.000+0100}, title = {How to search a social network }, url = {http://www.sciencedirect.com/science/article/pii/S0378873305000109}, volume = 27, year = 2005 }