Complex networks and decentralized search algorithms
- Autores: Jon Kleinberg
- Localización: Proceedings oh the International Congress of Mathematicians: Madrid, August 22-30,2006 : invited lectures / coord. por Marta Sanz Solé
, Javier Soria de Diego , Juan Luis Varona Malumbres , Joan Verdera , Vol. 3, 2006, ISBN 978-3-03719-022-7, págs. 1019-1044 - Idioma: inglés
- Enlaces
-
Resumen
The study of complex networks has emerged over the past several years as a theme spanning many disciplines, ranging from mathematics and computer science to the social and biological sciences. A significant amount of recent work in this area has focused on the development of random graph models that capture some of the qualitative properties observed in large-scale network data; such models have the potential to help us reason, at a general level, about the ways in which real-world networks are organized.
We survey one particular line of network research, concerned with small-world phenomena and decentralized search algorithms, that illustrates this style of analysis. We begin by describing awell-known experiment that provided the first empirical basis for the �six degrees of separation� phenomenon in social networks; wethen discuss some probabilistic network models motivated by this work, illustrating how these models lead to novel algorithmic and graph-theoretic questions, and how they are supported by recent empirical studies of large social networks.
