算法---algorithms-divide-conquer--graphs(week4) part2

1.Graph
1.1 Two ingredients
(1)vertices aka(also known as)nodes(V)(顶点)
(2)edges(E) = pairs of vertices(边)
can be undirected [unordered pair] or directed [ordered pair] (aka arcs(弧线))
directed edges：
first endpoint:tail,second endpoint:head
Examples:road networks, the Web, etc

1.2 Cuts of Graphs
Definition: a cut of a graph(V,E) is a partition of V into two non-empty sets A and B.
Definition:the crossing edges of a cut(A,B)are those with
(1)the one endpoint (端点) in each of (A,B)[无向图]
(2)tail in A, head in B: A—->B.[有向图]

1.3 The Minimum Cut Problem(最小割问题)
(1)INPUT: An undirected graph G = (V,E).(无向图)
[parallel edges allowed]
(2)Goal:Compute a cut with fewest numbers of cross edges.(a min cut)

2. Random Contraction Algorithm(Karger)
While there are more than 2 vertices
(1) pick a remaining edge$(u,v)$ uniformly at random.
(2)merge (or “contract”) $u$ and $v$ into a single vertex.
(3)remove self-loops
return cut represented by final 2 vertices.(其中一个来自A，其中一个来自B)

2.1 The Setup
Question: what is the probility of success?
(1)Fix a graph G = (V,E) (n个顶点(vertices)，m条边(edges)).
(2)Fix a minimum cut(A,B)
(3)Let k = # of edges crossing(A,B)。(Call these edges F,理解成最小割情况下： A,B两集合相连的边数)

2.2 What Could Go Wrong
(1)Suppose an edge of F is contracted at some point
(F中的某条边被收缩了，算法将不会输出(A，B))
(2)Suppose only edges inside A or inside B get contracted.
(若仅仅只有集合A或者集合B中内部的边被收缩，算法将会输出(A,B))
Thus.Pr[output is (A,B)] = Pr[never contracts an edge
of F]
Let $S_i$ = event that an edge of F contracted in iteration i.(对每次迭代中F中某条边被收缩的概率)
Goal:
Compute $Pr[\neg S_1 \land \neg S_2\land \neg S_3 \land ......\land \neg S_{n-2}]$(理解成所有$S_i$事件不发生的概率的交集)
其中:
$Pr[S_1]=\frac{crossing edges}{ edges}$

2.3 The First Iteration
Key Observation: degree of each vertex is at least k.
(每个顶点的度：为每个顶点相连的边)
Reason: each vertex v defines a cut $(\{v\}.V-\{v\})$.
Since $\sum_{v}degree(v) = 2m\geq kn$.
We have $m\geq\frac{kn}{2}$
Since$Pr[S_1]=\frac{k}{m},Pr[S_1]\leq \frac{2}{n}$

2.4 The Second Iteration

Recall: $Pr[\neg S_1 \land \neg S_2]=Pr[\neg S_2|\neg S_1].Pr[\neg S_1]$ 其中： $Pr[\neg S_2|\neg S_1]=1-\frac{k}{ remaing edges}$ $Pr[\neg S_1] \geq (1-\frac{2}{n})$ Note: all nodes in contracted graph define cuts in G (with at least k crossing edges) all degrees in contracted graph are at least k. of remaining edges $\geq \frac{1}{2} k (n-1)$

$Pr[\neg S_2 | \neg S_1] \geq 1 - \frac{2}{n-1}$

All Iterations:
In general :
$Pr[\neg S_1 \land \neg S_2 \land \neg S_3...\land \neg S_{n-2}$
$=Pr[\neg S_1] Pr[\neg S_2| \neg S_1] Pr[\neg S_3|\neg S_2 \land \neg S_1]..Pr[\neg S_{n-2}| \neg S_1 \land ...\land \neg S_{n-3}]$
$\geq (1-\frac{2}{n})(1-\frac{2}{n-1})(1-\frac{2}{n-2}..(1-\frac{2}{n-(n-4)})(1-\frac{2}{n-(n-3)})$
$=\frac{2}{n(n-1)} \geq \frac{1}{n^2}$
Problem: low success probability(But:n on trivial)
(成功的概率比较小)
2.5重复试验(Repeated Trials)
Solution: run the basic algorithm a large number N times,
remember the smallest cut found.
Question: how many trials needed?
Let $T_i=$ event that cut (A,B) is found on the $i^{th}$ try.
by definition, different $T_i$’s are independent.
So:
$Pr[all N trials fail] = Pr[\neg T_1 \land \neg T_2 \land ...\neg T_N]$
$=\Pi^N_{i=1}Pr[\neg T_i] \leq (1-\frac{1}{n^2})^N$ (相互独立)

3. Counting Mininum Cuts.
3.1 The number of Minimun Cuts
NOTE: A graph can have multiple min cuts.
(a tree with n vertices has (n-1) minimum cuts)
Question: What’s the largest number of min cuts that a graph with n vertices can have?
Answer: $C_n^2 = \frac{n(n-1)}{2}$