%0 Journal Article %1 Adamik-Small-1999 %A Adamik, Lada A. %D 1999 %E Springer, %K small_ small_world_networks web wismasys0809 world_ %T The small world Web %U http://www.hpl.hp.com/research/idl/papers/smallworld/smallworldpaper.html %X In a graph with a "small world" topology, nodes are highly clustered yet the path length between them is small. Small world networks which have already been identified are the collaboration graph of actors in feature films, the neural network of the nematode worm C. elegans, and the electrical grid of the western United States 1. In this paper I show that the World Wide Web is a small world as well, in that the largest connected component of sites forms a small world network. I demonstrate the advantages of a search engine which makes use of the fact that pages corresponding to a particular search query can form small world networks. In a further application, the search engine uses the small-worldness of its search results to measure the connectedness between communities on the Web.

@article{Adamik-Small-1999, abstract = {In a graph with a "small world" topology, nodes are highly clustered yet the path length between them is small. Small world networks which have already been identified are the collaboration graph of actors in feature films, the neural network of the nematode worm C. elegans, and the electrical grid of the western United States [1]. In this paper I show that the World Wide Web is a small world as well, in that the largest connected component of sites forms a small world network. I demonstrate the advantages of a search engine which makes use of the fact that pages corresponding to a particular search query can form small world networks. In a further application, the search engine uses the small-worldness of its search results to measure the connectedness between communities on the Web.}, added-at = {2008-11-12T13:03:08.000+0100}, author = {Adamik, Lada A.}, biburl = {https://www.bibsonomy.org/bibtex/23522881ac316b496b9199a608a450e4f/zoka}, editor = {Springer}, interhash = {54971e00e9dcd6c37812e158c0f37d0b}, intrahash = {3522881ac316b496b9199a608a450e4f}, keywords = {small_ small_world_networks web wismasys0809 world_}, timestamp = {2008-11-12T13:03:08.000+0100}, title = {The small world Web}, url = {http://www.hpl.hp.com/research/idl/papers/smallworld/smallworldpaper.html}, year = 1999 }