This project uses computer simulations to study networks with different degree distribution and various centrality measures.

(a) Use the configurational mode described in Sec. 8.5.1 to numerically generate networks which have exponential, algebraic or binomial degree distributions. Choose a reasonable number of nodes, not too small but neither so large that your computer struggles to run the simulations.

(b) For each of the above network categories, determine the eigenvector centrality for the nodes and inspect visually how the nodes with high rank are situated in the network.

(c) Use available library routines to compute the PageRank for the nodes of the networks considered in (b) and compare with the eigenvector centrality.

(d) Compute the closeness and betweenness centralities for the nodes of the networks in (a) and compare the behaviour across the different functional forms of the degree distribution. 

(e) Use community detection algorithms available online, e.g. the Louvain algorithm, to determine the community structure of the networks in (a) and compare the behaviour across the different functional forms of the degree distribution.