Reference no: EM132543177

Implementation of models of complex networks.

Implement generators of complex networks for, at least, two of the following models of complex networks (sorted by increasing difficulty), which must include at least one of the two last ones (BA or CM):
• Erdös-Rényi (ER) networks, either G(N,K) or G(N,p)
• Watts-Strogatz (WS) small-world model
• Barabási & Albert (BA) preferential attachment model
• Configuration Model (CM)
The correction, the number, and the difficulty of the implemented models will be taken into account.
It is not allowed to use already implemented network generators such as the ones in NetworkX or Pajek. You may use libraries implementing "network" or "graph" data types, to avoid unnecessary work, but not the algorithms for the generation of networks for these models.
The delivery must include:
• Source code

• Networks generated for the selected models, with different sizes N (e.g. N=50, 100, 1000) and for different values of the parameters of the models:
o ER: different values of "K" for G(N,K), or of "p" for G(N,p), such that e.g. <k>=3, 6, 10

o WS: different values of "p", including p=0, e.g. p=0.0, 0.1, 0.2, 0.5, 0.9, 1.0
o BA: different values of "m" (number of edges that each new nodes forms with the existing nodes), e.g. m=1, 2, 5

o CM: different degree distributions: Poisson (ER), e.g. <k>=2, 4; power-law (SF) with different exponents, e.g. gamma=2.2, 2.7, 3.5
• It is not necessary to generate networks for all the combinations of the parameters, e.g. for the BA you could fix N=1000 and just modify m.
• It is mandatory, for each model, to generate one network of size N=1000 and another of N=10000.
• Document (in PDF) with all the results:
o Short explanations on how have you done the required work (software, decisions, etc.)
o Plots of some of the small size generated networks, e.g. N=50 (ER, WS), N=100 (BA, CM)
o Plots of the degree distributions, including the theoretical values (corresponding to the selected parameters) and the experimental ones (for the generated network), for the networks of size N>=1000.
o Estimation of the exponent for the empirical degree distributions of BA and CM(SF), for the networks of size N>=1000.

• Do not include in the delivery (zip, rar or tgz file) the largest networks with N > 1000 nodes, their plots of degree distribution and estimation of parameters is enough.

Attachment:- A2.rar