02 JAN 2011 by ideonexus

## Graph Theory Approach to Web Topology

Perhaps the best-known paradigm for studying the Web is graph theory. The Web can be seen as a graph whose nodes are pages and whose (directed) edges are links. Because very few weblinks are random, it is clear that the edges of the graph encode much structure that is seen by designers and authors of content as important. Strongly connected parts of the webgraph correspond to what are called cybercommunities and early investigations, for example by Kumar et al, led to the discovery and mappin...The graph theory approach produces a model of the web that is like a bowtie, and filled with other bowties, like a fractal. There is an image in the original document of this phenomena.

02 JAN 2011 by ideonexus

## Compactness in Linked Hypertext

Global metrics look at extracting information about the graph as a whole. Compactness is a measure of how connected the graph is; a compact graph means that, in general, it is easy to reach a randomlychosen node from another. The usual measure has a range between 0 (totally disconnected nodes) and 1 (universal connections). Compactness of 0 is obviously hopeless for an information space, but perhaps less obviously the graph shouldn't be too compact either; if authors of webpages are sparing a...A brief summary of compactness in understanding web topology and balance.