Random graphs

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

[1]  Francis Heylighen,et al.  Collective Intelligence and its Implementation on the Web: Algorithms to Develop a Collective Mental Map , 1999, Comput. Math. Organ. Theory.

[2]  Francis Heylighen,et al.  The Science of Self-Organization and Adaptivity , 1999 .

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  J. Frankel,et al.  The gnutella protocol specification v0.4 document revision 1.2 , 2000 .

[5]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[6]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[7]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[8]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[9]  James F. Doyle,et al.  Peer-to-Peer: harnessing the power of disruptive technologies , 2001, UBIQ.

[10]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[11]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[12]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[13]  Karl Aberer,et al.  Advanced Peer-to-Peer Networking: The P-Grid System and its Applications , 2003, PIK Prax. Informationsverarbeitung Kommun..

[14]  M. Grossglauser,et al.  Networks out of Control : Models and Methods for Random Networks , 2005 .

[15]  J. Kleinberg.  Complex networks and decentralized search algorithms , 2006 .