Preferential Attachment.

This is the Algorithm I'm right now dealing with.

Preferential attachment is an algorithm developed to explain how a Network looks like and why it looks like it looks. First applications return to 1920's and 50's and were used to explain trofic chains, as an instance. It reflects the priority of highly connected nodes of a Network to attract new connexions among the other nodes.

We can see a very good example of such Network in the websites of the WWW. Thus, highly connected nodes -i.e. interesting or popular Web sites- will attract the attention of new users who want their logs or webs to link with interesting sites.

If we handle a Network wide enough, when studying the distribution of incoming links a web has we will find a funny distribution. Meanwhile, if the Web is not very large -it could mean that the number of links between sites grows enough faster than the number of webs grows- we find a not so funny distribution which is easy to handle.