Assignment: Algorithms for Complex Networks
1. Select a network dataset either from the course's Blackboard page or from The Index of Complex Networks. The network should be unweighted and undirected (but size does not matter much).
2. Write your own code to perform the k-core and onion decompositions of the network.
3. Visualize the k-core decomposition: Plot the number of nodes of coreness (or k-core centrality) equal to k on the y-axis vs k on the x-axis.
4. Visualize the onion decomposition: Plot the number of nodes of in the layer l on the y-axis vs l on the x-axis.
5. Optional (for 2 bonus points): Run a random walk (degree biased or unbiased) on the network for a long time and record the number of times each node is visited. Test whether the number of visits on node i is more correlated with its degree or its coreness (k-core centrality).
Attachment:- Jazzedge-List.rar