Assignment 1 (Due: 2/13)

Download the network of characters in Les Misérables and
  1. Visualize the network using network visualization tools such as Gephi or Cytoscape.
  2. Obtain the number of nodes and edges (it is undirected, unweighted network)
  3. Calculate the degree distribution.
  4. How many components does this network have?
  5. Calculate closeness centrality, betweenness centrality, and eigenvector centrality for each node.
  6. Calculate the path length distribution and average path length.
  7. Check whether the friendship paradox holds: calculate the average degree and the average degree of neighbors. What is the number of nodes who have larger degree than their neighbors?
Go back to the homepage.