Social Computing

1. What is the difference between 1-mode and 2-mode graph? Give an example for each.

2. What is a bipartite graph? Give an example.

3. What is the difference between a connected graph and a complete graph?

4. What is the diameter of a graph?

5. List various graph data structures to store social network information.

6. What is six degrees of separation in the context of social networks? What is the average degree of separation for Facebook and Twitter (you can cite other studies that have reported these statistics)?

7. What is strength of weak ties? Explain the rationale behind this phenomenon.

8. List and describe the various centrality measures. Also include their mathematical formulae.

9. What is triadic closure? How can you measure triadic closure property of a network? Explain why we observe a strong triadic closure in social networks.

10. Are co-citation measure and bibliographic coupling measure symmetric or asymmetric? Prove.