5008 Review

Lec 3：Network properties and web graph

Bridge edge:If we erase it, the graph becomes disconnected.

Articulation point:If we erase it, the graph becomes disconnected.

Largest Component: Giant Component

Isolated node (node H)

Connectivity of Directed Graphs

Strongly connected directed graph has a path from each node to every other node and vice versa (e.g., A-B path and B-A path)

Weakly connected directed graph is connected if we disregard the edge directions

强连通图：强连通图（Strongly Connected Graph）是指在有向图G中，如果对于每一对vi、vj，vi≠vj，从vi到vj和从vj到vi都存在路径，则称G是强连通图。

弱连通图: 将有向图的所有的有向边替换为无向边，所得到的图称为原图的基图。如果一个有向图的基图是连通图，则有向图是弱连通图。

Directed graph: avg indegree = avg outdegree = E/N; avg degree  = avg indegree+avg outdegree = 2E/N

Steps to compute the average degree of a directed graph.

1. Compute the degree (i.e., in_degree + out_degree) for each node

2. Compute the average of their degrees. 

Only one giant SCC(strongly connected component）

Bow-tie Structure of the Web

Lec 4: Structure of social network

 

 

 

 Lec 5b Network Communit

Edge Betweenness Centrality (EBC) is a measure describing the frequency at which an edge lies on the shortest path between pairs of nodes in a network 

Representation learning on Networks

 

A*3: entry value means the number of paths from node i to node j using 3 hops 

 

Lec 6: Centrality  

4 types of centrality: degree; betweeness; closeness; eigenvector

 

 

 Given suffient number of hops,we can go from any node to any other node in the graph; M^k has all entries non-zero

Lec 7:

Power-law degree exponent is typically 2 < alpha< 3

 

If the distribution is power law distribution, then its CCDF also follow power law distribution 

 Lec 7c: preferential attachment model