# Assignment 1 (Due: 2/13)

Download

the network of characters in

*Les MisÃ©rables* and

- Visualize the network using network visualization tools such as Gephi or Cytoscape.
- Obtain the number of nodes and edges (it is undirected, unweighted network)
- Calculate the degree distribution.
- How many components does this network have?
- Calculate closeness centrality, betweenness centrality, and eigenvector centrality for each node.
- Calculate the path length distribution and average path length.
- 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?