# 1. Read the article ‘Centrality and Network Flow, 2005.pdf’

1. Read the article ‘Centrality and Network Flow, 2005.pdf’ and refer to your answer for HW 2 when you are asked to construct networks. For one network that you discussed and one activity that you are interested in (e.g. exploring payments PayPal or For Sale Groups on the Facebook network, identifying the hastags that may become meme), what would be the appropriate centrality measure to use according to the article? Write a short paragraph to explain your rationale and post on the discussion board.2. Refer to p.43 Question 1 part a – What is the degree distribution for this graph?, d – Which node(s) have the highest degree? What is the degree?, e – Which node(s) have the lowest degree? What is the degree?, f – Which node has the highest closeness centrality?, g – Which node has the highest degree centrality?, h – What is the centralization (based on degree) of the graph?Construct and plot the network using the igraph package and the adjacency list you wrote for HW 2. To assign vertex names you can write it asg = graph(edges = c(‘a’, ‘b’, ‘b’, ‘c’), directed = FALSE)org = graph(edges = c(1, 2, 2, 3), directed = FALSE)V(g)\$name = c(‘a’, ‘b’, ‘c’)Answer question a, d, e, f, g, h using RUpload a Word/PDF file that contains you answers and paste code at the end. 