%0 Journal Article %1 keyhere %A Kleinberg, Jon %A Kumar, Ravi %A Raghavan, Prabhakar %A Rajagopalan, Sridhar %A Tomkins, Andrew %D 1999 %J Computing and Combinatorics %K TOREAD graphs measurement web %P 1--17 %T The Web as a Graph: Measurements, Models, and Methods %U http://dx.doi.org/10.1007/3-540-48686-0_1 %X The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today, over a billion links, and appears to grow exponentially withtime. There are many reasons — mathematical, sociological, and commercial — for studying the evolution of this graph. In thispaper we begin by describing two algorithms that operate on the Web graph, addressing problems from Web search and automaticcommunity discovery. We then report a number of measurements and properties of this graph that manifested themselves as weran these algorithms on the Web. Finally, we observe that traditional random graph models do not explain these observations,and we propose a new family of random graph models. These models point to a rich new sub-field of the study of random graphs,and raise questions about the analysis of graph algorithms on the Web.

@article{keyhere, abstract = {The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today, over a billion links, and appears to grow exponentially withtime. There are many reasons — mathematical, sociological, and commercial — for studying the evolution of this graph. In thispaper we begin by describing two algorithms that operate on the Web graph, addressing problems from Web search and automaticcommunity discovery. We then report a number of measurements and properties of this graph that manifested themselves as weran these algorithms on the Web. Finally, we observe that traditional random graph models do not explain these observations,and we propose a new family of random graph models. These models point to a rich new sub-field of the study of random graphs,and raise questions about the analysis of graph algorithms on the Web.}, added-at = {2008-07-01T16:43:05.000+0200}, author = {Kleinberg, Jon and Kumar, Ravi and Raghavan, Prabhakar and Rajagopalan, Sridhar and Tomkins, Andrew}, biburl = {https://www.bibsonomy.org/bibtex/205c84de5132eca5fe9e033439d3cc464/chriskoerner}, description = {SpringerLink - Book Chapter}, interhash = {264c1893a76dabd834beddcd889080e0}, intrahash = {05c84de5132eca5fe9e033439d3cc464}, journal = {Computing and Combinatorics}, keywords = {TOREAD graphs measurement web}, pages = {1--17}, timestamp = {2008-07-01T16:43:05.000+0200}, title = {The Web as a Graph: Measurements, Models, and Methods}, url = {http://dx.doi.org/10.1007/3-540-48686-0_1}, year = 1999 }