Identity and Search in Social Networks
D. J. Watts, P. S. Dodds, M. E. J. Newman
Abstract
Social networks have the surprising property of being "searchable": Ordinary people are capable of directing messages through their network of acquaintances to reach a specific but distant target person in only a few steps. We present a model that offers an explanation of social network searchability in terms of recognizable personal identities: sets of characteristics measured along a number of social dimensions. Our model defines a class of searchable networks and a method for searching them that may be applicable to many network search problems, including the location of data files in peer-to-peer networks, pages on the World Wide Web, and information in distributed databases.
Create a lesson
Related papers
Quantum Localization in Geometric Complex Networks
Jan Lewenstein-Sanpera, Tobias Grass, M. Àngeles Serrano et al.
Eigenstate transitions and critical transport in 3D Aubry-André model
Pragna Das, Lev Vidmar, Miroslav Hopjan
Weyl's theorem and the theoretical origin of Boson peak in two-dimensional scalar spring network
Cunyuan Jiang
On physical implementability of reinforcement-learning-driven reasoning
Eiji Konishi
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin
Short-Range Vector Spin Glasses: Parisi Hierarchies and Real-Space Ultrametricity
Akash Vijay, Jaewon Kim, Jong Yeon Lee