Rajan M. Lukose, Eytan Adar, Joshua R. Tyler
A computationally enhanced message contains some embedded programmatic components that are interpreted and executed automatically upon receipt. Unlike ordinary text email or instant messages, they...
Strong Regularities in World Wide Web Surfing (2007)
B. H. Hager, M. A. Richards, Philos Trans R, Bernardo A. Huberman, James E. Pitkow, ...
26. This CMB response time is accelerated by a factor of 2, relative to a model without core heating. 27. The correspondence of the mantle response time and the time period for reliable...
Random Networks Growing Under a Diameter Constraint (2003)
Lukose, Rajan M., Adamic, Lada A.
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 that if the graph...
SHOCK: Communicating with Computational Messages and Automatic Private Profiles (2003)
Lukose, Rajan M., Adar, Eytan, Tyler, Joshua R., Sengupta, Caesar
A computationally enhanced message contains some embedded programmatic components that are interpreted and executed automatically upon receipt. Unlike ordinary text email or instant messages, they...
Local search in unstructured networks (2003)
Lada A. Adamic, Rajan M. Lukose, Bernardo A. Huberman
Recently, studies of networks in a wide variety of fields, from biology to social science to computer science, have revealed some commonalities [4]. It has become clear that the simplest classical...
Local Search in Unstructured Networks (2002)
Adamic, Lada A., Lukose, Rajan M., Huberman, Bernardo A.
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 sharing systems,...
Intentional Walks on Scale Free Small Worlds (2001)
Puniyani, Amit R, Lukose, Rajan M, Huberman, Bernardo A
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 study the dynamics of...
the World Wide Web. comment, Science, 287:2115a, 2000. (2001)
Webgraph Papers, Daniel M. Abrams, Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank Mcsherry, ...
In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 171–180, 2000. [12] William Aiello, Fan R. K. Chung, and Linyuan Lu. Random evolution