Internet: Diameter of the World-Wide Web

@article{Albert1999InternetDO,
  title={Internet: Diameter of the World-Wide Web},
  author={R. Albert and H. Jeong and A. Barabasi},
  journal={Nature},
  year={1999},
  volume={401},
  pages={130-131}
}
Despite its increasing role in communication, the World-Wide Web remains uncontrolled: any individual or institution can create a website with any number of documents and links. This unregulated growth leads to a huge and complex web, which becomes a large directed graph whose vertices are documents and whose edges are links (URLs) that point from one document to another. The topology of this graph determines the web's connectivity and consequently how effectively we can locate information on… Expand
View on Springer
arxiv.org
3,751 Citations
Highly Influential Citations
144
Background Citations
918
Methods Citations
145
Results Citations
23

3,751 Citations

Citation Type

Citation Type

The Web as a graph
TLDR
A set of algorithms that operate on the Web graph are reviewed, addressing problems from Web search, automatic community discovery, and classification, and a new family of random graph models are proposed. Expand
Graph structure in the Web
TLDR
The study of the web as a graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. Expand
World Wide Web: A Graph-Theoretic Perspective
TLDR
Various problems to be explored for understanding the structure of the WWW are discussed and many research directions are identified such as Web caching, prevention of security threats, user-flow analysis, etc. Expand
On Web’s contact structure
TLDR
It is shown that Web is still a scale-free network, with three main classes of nodes: very few huge nodes, the hubs, a significant number of intermediate nodes, an huge number of small nodes. Expand
Mapping the “Worlds” of the World Wide Web
The World Wide Web is barely 10 years old and already spans the globe, comprising more than a billion public pages and 3 million servers. It is a decentralized information space, created and… Expand
A Hierarchical Model of Web Graph
TLDR
A hierarchical model of Web graph is proposed which exploits both link structure and hierarchical relations of Web pages and reveals many properties about the evolution of pages, sites and the relation among them. Expand
The diameter of protean graphs
  • P. Prałat
  • Computer Science, Mathematics
  • Discret. Math.
  • 2008
TLDR
The main result is that diameter of the giant component of P"n(d,@h) is equal to @Q(logn), which supports experimental data observed in the actual web graph. Expand
A Simulation of the Structure of the World-Wide Web
In this paper we are presenting a simple simulation of the Internet World-Wide Web, where one observes the appearance of web pages belonging to different web sites, covering a number of different… Expand
Locality, Hierarchy, and Bidirectionality in the Web∗
TLDR
Evidence is provided, based on a crawl of over a billion pages, that such a clustering effect corresponds very closely to the hierarchical nature of URLs and it is shown that bidirectionality on the web graph is much more common than previous models predicted. Expand
How Large Is the World Wide Web
TLDR
The present chapter focuses on size in terms of the number N of Web pages, which is the part of the Web that is considered for indexing by the major search engines. Expand
...
1
2
3
4
5
...

References

SHOWING 1-7 OF 7 REFERENCES
Accessibility of information on the web
TLDR
As the web becomes a major communications medium, the data on it must be made more accessible, and search engines need to make the data more accessible. Expand
Small-World Networks: Evidence for a Crossover Picture
Watts and Strogatz [Nature (London) 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the… Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
Nature Web Matters
  • Nature Web Matters
  • 1999
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 1999
Fractals in science
Publ. Math. Inst. Hung. Acad. Sci
  • Publ. Math. Inst. Hung. Acad. Sci
  • 1960