Consider the deterministic scale-free network model in Section 5.11 where new links are con- nected between the root hub node and newly introduced leaf nodes. Modify the network model in such a way that at each step of iteration, all nodes, that is, leaf as well as non-leaf nodes, make connection with the root hub node. Write a computer program to realize the deterministic scale-free network model. Also, plot the degree distribution of the deterministic model. Note that the program should take only the total number of iterations as a user input.

What will be an ideal response?

This problem is a computer-based exercise. Some Matlab code fractions available for simula-
tions can be found at https://complexnetworksbook.github.io.