11 citations · 12 across the 2 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
cond-mat.other2003★ 11 cited
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…
cond-mat.stat-mech2003★ 1 cited
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…