社交网络分析（Social Network Analysis）

Soical Network Analysis 是密歇根大学Lada Adamic教授在Coursera上开的一门课。主要介绍了Social Network中的一些基本概念，比如Centrality，Betweeness，Modularity等等，如何使用工具（Gephi，NetLogo等等）去分析Social Network，如何检测Social Network中的Community，不需要任何专业基础。对于程序员出身的同学，课程中也提到了如何用R去分析Social Network。

第一周 

这周只是讲了一些 Social Network Graph的基本概念： 

Node 

Edge（directed edge， undirected edge）

Indegree

Outdegree

这些概念比较简单，不再重复了。

Social Network Graph的表示主要有三种方式：

1. Adjacency matrix

2. Edge list

3. Adjacency list

对下面这张简单的图，三种表示方式分别为：

1. Adjacency matrix

2. Edge list

2,3

2,4

3,2

3,4

4,5

5,1

5,2

3. Adjacency list

1:

2: 3 4

3: 2 4

4: 5

5: 1 2

接下来是最重要的一个概念了：strongly connected component， weakly connected component， giant component

Strongly connected component: Each node within the component can be reached from every other node in the component by following directed links.

任意两个节点必须相互能到达

Weakly connected component: Each node within the component can be reached from every other node by following either direction.

任意两个节点只需要有一个方向能到达就可以

Giant component：If the largest connect component encompasses a significant fraction of the graph, it is called the giant component.

到底多大比例算significant呢？maybe 5%， maybe 10%……

第二周

这周主要讲了两个随机网络模型，一个是Erdos-Renyi模型，另一个是 Barabasi-Albert模型。这周的概念涉及： 连通组件（强连通，弱连通），最大连通分支，平均最短距离，直径，广度优先搜索

第五周

Question 1

Download Lada's Facebook network. Load it in Gephi (as undirected). Note the number of nodes and edges present. Calculate the clustering coefficient and average shortest path (this is OK to take as-is even though the network is not connected). Next close the project, and after you have blank slate, generate an Erdos Renyi random graph (File > Generate > Random graph...) with the same number of nodes and edges (you'll have to figure out the corresponding wiring probability to achieve this). It will produce a directed network. Calculate the clustering coefficient and average shortest path for this random network, making sure to treat the network as undirected. Which of the following observations is true?

the random graph has fewer connected components than Lada's actual network

the average shortest path is longer than 3 hops

the average clustering coefficient in Lada's egonetwork is lower than 0.4

the topology of Lada's network does not satisfy the definition of a small world network

Here is the result:

	Lada's Facebook network	Erdros Renyi Random Graph(wiring probablity=0.049)
Nodes	388	388
Edges	3598	3620
Network Diameter	8	4
Connect Components	20	1
Average Clustering Coefficient	0.534	0.049
Average Shortest Path	2.781	2.34

Question 2

Download the a snapshot of the Gnutella peer-to-peer filesharing network (now over a decade old). Go through the same procedure: Load it in Gephi (as undirected). Note the number of n