cnt2k9 tp4 aritra

The goal of the project is to run simulations of real world complex networks (like social networks) where a number of operations are possible each with some finite probability say Pi and note the outcome.

For example say we have a random network and the following operations are possible

1.An existing edge is re-wired with probability ‘p’.


2.A new node is introduced with probability ‘q’.


3.An edge is deleted with probability ‘r’


4.A node is deleted with probability (1-p-r-r).


and so on..

Our goal is to monitor how this network change with time and draw out patterns how various graphs change over iteration or do different starting graphs yield some similar structure etc. etc.

Code for link re-wiring with probability 1 is complete
the simulation test bench is also ready which can be used to generate the degree distribution of the resulting graph after k iterations

A bimodal graph with low degree = 2 , high degree = 20 and fraction of nodes having low degree = 0.8
re-wiring was done for 1000 steps and recording the graph structure at intervals of 100 steps
the whole procedure was repeated for 10 times and the average result was used.

Sample Inputhttp://wikispot.org/Create_a_wiki?action=Files&do=view&target=Model%20Input.txt[http://www.example.com]

Please go through the attachment

Code for re-wiringhttp://wikispot.org/Create_a_wiki?action=Files&do=view&target=relink.zip

Please go though the attachment

result

code to generate powerlaw networks http://wikispot.org/Create_a_wiki?action=Files&do=view&target=powerlaw.zip

code to generate bimodal networks http://wikispot.org/Create_a_wiki?action=Files&do=view&target=bimodal.zip

Bivas Mitra