A partial knowledge of friends of friends speeds social search
Name
A partial knowledge of friends of friends speeds social search.pdf
Size
935.76 KB
Format
Adobe PDF
Checksum (MD5)
035935b8586a84e60c14348347e438f3
Author(s)
Elsisy, Amr
Szymanski, Boleslaw K.
Plum, Jasmine A.
Qi, Miao
Pentland, Alex
Date Issued
August 19, 2021
Publisher
PLoS ONE
Citation
Elsisy, A., Szymanski, B. K., Plum, J. A., Qi, M., & Pentland, A. (2021). A partial knowledge of friends of friends speeds social search. Plos one, 16(8), e0255982.
Abstract
Milgram empirically showed that people knowing only connections to their friends could locate any person in the U.S. in a few steps. Later research showed that social network topology enables a node aware of its full routing to find an arbitrary target in even fewer steps. Yet, the success of people in forwarding efficiently knowing only personal connections is still not fully explained. To study this problem, we emulate it on a real location-based social network, Gowalla. It provides explicit information about friends and temporal locations of each user useful for studies of human mobility. Here, we use it to conduct a massive computational experiment to establish new necessary and sufficient conditions for achieving social search efficiency. The results demonstrate that only the distribution of friendship edges and the partial knowledge of friends of friends are essential and sufficient for the efficiency of social search. Surprisingly, the efficiency of the search using the original distribution of friendship edges is not dependent on how the nodes are distributed into space. Moreover, the effect of using a limited knowledge that each node possesses about friends of its friends is strongly nonlinear. We show that gains of such use grow statistically significantly only when this knowledge is limited to a small fraction of friends of friends.
MIT Department
MIT Connection Science (Research institute)
Terms of Use
Attribution-NonCommercial-ShareAlike 3.0 United States
Persistent DSpace Link
