A partial knowledge of friends of friends speeds social search.

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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Amr Elsisy, Boleslaw K Szymanski, Jasmine A Plum, Miao Qi, Alex Pentland
Formato:	article
Lenguaje:	EN
Publicado:	Public Library of Science (PLoS) 2021
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/99ff97289b454311b2dc37b6a342017d
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:99ff97289b454311b2dc37b6a342017d
record_format	dspace
spelling	oai:doaj.org-article:99ff97289b454311b2dc37b6a342017d2021-12-02T20:17:43ZA partial knowledge of friends of friends speeds social search.1932-620310.1371/journal.pone.0255982https://doaj.org/article/99ff97289b454311b2dc37b6a342017d2021-01-01T00:00:00Zhttps://doi.org/10.1371/journal.pone.0255982https://doaj.org/toc/1932-6203Milgram 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.Amr ElsisyBoleslaw K SzymanskiJasmine A PlumMiao QiAlex PentlandPublic Library of Science (PLoS)articleMedicineRScienceQENPLoS ONE, Vol 16, Iss 8, p e0255982 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Amr Elsisy Boleslaw K Szymanski Jasmine A Plum Miao Qi Alex Pentland A partial knowledge of friends of friends speeds social search.
description	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.
format	article
author	Amr Elsisy Boleslaw K Szymanski Jasmine A Plum Miao Qi Alex Pentland
author_facet	Amr Elsisy Boleslaw K Szymanski Jasmine A Plum Miao Qi Alex Pentland
author_sort	Amr Elsisy
title	A partial knowledge of friends of friends speeds social search.
title_short	A partial knowledge of friends of friends speeds social search.
title_full	A partial knowledge of friends of friends speeds social search.
title_fullStr	A partial knowledge of friends of friends speeds social search.
title_full_unstemmed	A partial knowledge of friends of friends speeds social search.
title_sort	partial knowledge of friends of friends speeds social search.
publisher	Public Library of Science (PLoS)
publishDate	2021
url	https://doaj.org/article/99ff97289b454311b2dc37b6a342017d
work_keys_str_mv	AT amrelsisy apartialknowledgeoffriendsoffriendsspeedssocialsearch AT boleslawkszymanski apartialknowledgeoffriendsoffriendsspeedssocialsearch AT jasmineaplum apartialknowledgeoffriendsoffriendsspeedssocialsearch AT miaoqi apartialknowledgeoffriendsoffriendsspeedssocialsearch AT alexpentland apartialknowledgeoffriendsoffriendsspeedssocialsearch AT amrelsisy partialknowledgeoffriendsoffriendsspeedssocialsearch AT boleslawkszymanski partialknowledgeoffriendsoffriendsspeedssocialsearch AT jasmineaplum partialknowledgeoffriendsoffriendsspeedssocialsearch AT miaoqi partialknowledgeoffriendsoffriendsspeedssocialsearch AT alexpentland partialknowledgeoffriendsoffriendsspeedssocialsearch
_version_	1718374360202346496

A partial knowledge of friends of friends speeds social search.

Ejemplares similares