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.

Debugging...

That's the state I find myself right now at... and for sure the state you may find the most of the programmers of the world at.

Does someone know about an algorithm which debugs by itself? Any fitted neural network?

Once I heard about Genetic Programming, but I did not research enough about that... I wonder if we could get rid of the debugging problem just by killing the amorphous programs of a huuuge set. ?¿

Welcome to my life as programmer.

Hey people!

In this blog here I want to post many articles, codes, whatever; related to programming. I'll mainly speak about algorithms and ForTran. The first because they're independent of the language and the second because it's the programming language I got used to.

Right now, I'm following some lectures on Computational Physics and it may be that my firsts posts are an update of the work I've done to the date. But with the time I expect to write about more interesting issues.

Thank you for dropping by and leave a comment!