Social Network Analysis, computer science homework help

Social Network Analysis, computer science homework help

1) Explain the difference between centralization and node centrality.( See attach pic)

2) For the following network answer the following questions using formulas or R. (a) Calculate node B’s Normalized degree centrality. (b) Calculate node D’s Normalized Closeness Centrality . (C) Calculate node C’s Non – normalized Betweenness Centrality. ( See attach pic)

3) Give a real life directed network example in which the nodes with high – in – degree centrality (large number of incoming edges) may not have high out degree centrality. ( See attach pic)

4) Explain why finding shortest path between nodes is important for social network analysis? ( See attach pic)

5) In the social network below, each edge is labeled ‘W’ for weak tie, or “S” for strong tie. Identify all the nodes that violate the String Triadic Closure Property. Explain Why. ( See attach pic)

6) According to Twitters quarterly filing to SEC, about 8.5 % of all Twitter’s monthly users are programmatically updated without user actions. These are refered to as “bots”. These bots mimic the tweeting behavior of real humans and organizations. Suppose that you are hired by Twitter, propose two different ways to automatically detect these bots and brief explain your reasoning. (See attach pic)

7) For three graphs on the next page, without computing the measure for all nodes, which of them have the highest.

a) Diameter

b) Density

c) Transitivity

Breifly explain why ? ( See attach pic )

"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.

Discount Code: CIPD30

Click ORDER NOW..