11 citations · 12 across the 2 of their papers we have counts for
6 papers
How to search a social network
Lada A. Adamic, Eytan Adar
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…
Random Networks Growing Under a Diameter Constraint
Rajan M. Lukose, Lada A. Adamic
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show…
Local Search in Unstructured Networks
Lada A. Adamic, Rajan M. Lukose, Bernardo A. Huberman
We review a number of message-passing algorithms that can be used to search through power-law networks. Most of these algorithms are meant to be improvements for peer-to-peer file…
Comment to "Emergence of Scaling in Random Networks" (cond-mat/9910332)
Lada A. Adamic, Bernardo A. Huberman
A recent paper "Emergence of scaling in random networks" (cond-mat/9910332) by Barabasi and Albert proposes a growth mechanism to produce a stationary scale free distribution of th…
Evolutionary Dynamics of the World Wide Web
Bernardo A. Huberman, Lada A. Adamic
We present a theory for the growth dynamics of the World Wide Web that takes into account the wide range of stochastic growth rates in the number of pages per site, as well as the…
Novelty and Social Search in the World Wide Web
Bernardo A. Huberman, Lada A. Adamic
The World Wide Web is fast becoming a source of information for a large part of the world's population. Because of its sheer size and complexity users often resort to recommendatio…