There are now tens of thousands of domains, several servers in each domain, and many pages in each server. For reasons of size, mainly, let us regard domain names as the nodes of the Web. We may further reduce the size of the network to be visualized by considering only the suffices edu or org. Besides reducing to a smaller number of nodes, we might anticipate that the domains in the com class are relatively sparsely connected, and thus less interesting from the mathematical point of view. The interconnections of the WWW, as a hypertext and hypermedia system, are links.
Links connect pages, but pages are secondary to domains according to our choice above.
Thus, given two domains, that is, nodes, we must determine all links from any page of the first domain, to any page of the second domain. Then this simple count should be normalized. Thus, the connection strength we are proposing here is the ratio of the number of links to the product of the width and the height. However, this data is much more expensive to obtain. In any case, the data to construct the massive connection matrix for the entire WWW is to be col- lected by a Web crawler or robot, not just once, but repeatedly, according to our larger plan.