1.2k citations · 1.2k across the 5 of their papers we have counts for
5 papers
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…
Growing random networks under constraints
Amit Puniyani, Rajan Lukose
We study the evolution of a random graph under the constraint that the diameter remain constant as the graph grows. We show that if the graph maintains the form of its link distrib…
Intentional Walks on Scale Free Small Worlds
Amit R Puniyani, Rajan M Lukose, Bernardo A Huberman
We present a novel algorithm that generates scale free small world graphs such as those found in the World Wide Web,social and metabolic networks. We use the generated graphs to st…
Search in Power-Law Networks
L. A. Adamic, R. M. Lukose, A. R. Puniyani +1
Many communication and social networks have power-law link distributions, containing a few nodes which have a very high degree and many with low degree. The high connectivity nodes…