C1
C2
C3
C4
C5
=
=
=
=
=
x2
x2
x1
x1
x1
∨
∨
∨
∨
∨
x3
x3
x2
x2
x2
∨
∨
∨
∨
∨
x4
x4
x4
x3
x4
!"
#
$
%
&
%
( )*
+
,- . / " -
Xj =
/
./
1 if clause C j is satisfied
0 otherwise.
0 1 )'2
'
3
()*
≥ ,- .
,- . / ( )*
4
%
5
%
%
7 %
;
()*
8 9
%
%
≥ ( )*
" /
/
7
8
:
. ≥
)1* 2
≥ ( )*
k = E[ X ]
=
j≥0
jpj
=
j<7 k / 8
≤
≤
<
≥
jpj +
( 78k − 81 )
j<7 k / 8
jpj
j≥7 k / 8
pj + k
( 87 k − 81 ) ⋅ 1 + k p
pj
j≥7 k / 8
) 1* 2
6
#
≥ (>)*
#
:
,
+
)1* 2
/
E[X ] =
∞
j ⋅ Pr[X = j] =
j=0
∞
j (1− p)
j=0
-< ?
8 9
≥
%
@@(.
ρ A ()*
j−1
p ∞
p 1− p
1
p =
j (1− p) j =
⋅ 2 =
1− p j=0
1− p p
p
" / !"
≤*
ρ
=
!
/1
#$
% $
1
! % >
; #
; " >
#
"
2
2
%
C
$
D%
1
2
∈
1
2
>
B
"
H
'H
H
6H
&'
" >
7
#
#
/C
1>
())*+
D
2
I
%
1
'
%
2
%
E
E
;
;
F
G
'
1
%
2≥
0
1
2
1 0 2)'
F
k
2
=
G ≤
k (n − j ) / 2 n − j
(
,
≥ -.
$
-
+
Pr[E1 ∩ E2
∩ En−2 ] = Pr[E1 ] × Pr[E2 | E1 ] ×
≥
=
=
≥
2
(1− 2n ) (1− n−1
)
( )( )
n −2
n
2
n(n−1)
n−3
n −1
× Pr[En−2 | E1 ∩ E2
(1− 24 ) (1− 23)
( 24 ) ( 13 )
∩ En−3 ]
2
n2
*
$
/ 1−
J
2
n2
2
/ 1− 2
n
+
≤ 1 ) 2
1 0 ) 2
2
1− 2
n
#
'
K
>
n 2 ln n
=
2
1− 2
n
1
%
E1
k
1n2
2
2ln n
>
2
( )
≤ e
−1 2ln n
1
n2
=
E1 2
2
>
%
%
@
"
8
;
/ 0
1
7
>
+ M
;
%
$
2
3
! >
%
7
%
N
>
O
+
M
%
>
P8 9
8
7
%
L
2
2 -8
7
. Q
E
; J
; J
4
%
%
%
-+
M
4
%
%
≥&
. Q
" ⊆ R"" ⊆ #" ⊆ ! "
3
Q
N
" / R"": Q
%
R"" / #": Q
$
#" / ! ":
:
!
>
"
(
S
7
P
1
%
>
2
4
+
+
P
:
/
/
,- . / " - / . / )
,- . / ,- . T U T ,- . /
/
L
TU T
) TU T )
%
/
'
!
>
!
"
-
S
,
4
"
+
+
:
J
/
/
Θ1
2
/
L
TU T
%
,- . / " - / . / )1 0 I 0 2
,- . / ,- . T U T ,- . / ) T U T )' T ) / 1 2 / Θ1
2
"
$
"
H,
1
N
>
2H
≥
< %
:
/
T
Θ1
"
+
1
/
/
E[X ] =
n−1
j=0
E[X j ] =
n−1
j=0
L
T
L
/ 2
2
TU T
n 1
n
= n
= n H(n)
n− j
i=1 i
! " #$%
! %" #$
6
"
2
5
U
;
%
>
2
6
$
%
&'
&(
"
)
)
)
%
H " 1
'H " H " -
. ≥ )1 ⋅ 2
2
$
' ⋅
&
.≤ )
' ⋅
.≥
'
0 )
=
"
"
2
2
6
. ≥ )1 ⋅ 2
" K
. /
" -
1 0 2
0
'
; 8
$
; 1 0 ) 2
; 1 0 ) 2
%
0
*
/ )
'
)6
)'
)
%
)
B
"
2
2
⋅
" -
"
.≤
K
" ≤ - ) .
/ 0
⋅
' ⋅
/" j =1
≤
n
" j =1
22 ⋅ .
.≥
' ⋅
" n
0
%
. ≤ -1 0 )1
" -
"
6
' ⋅
' ⋅
0 )
.
.
.≤
⋅
0'
/ )
(
#
+
/1
2
$
%
1
≥ )'2
RandIndenpendentSet(G) {
A = empty set
for each v in V
add v to A with probability p
for each edge e between vertices in A
delete one endpoint of e from A
return A
}
"
;
;
"
/ ')6
K
$
'
%
,- V V . ≥ ,/ )' 2
0
%
. / ,- . 0 ,- . /
0
'
1
$ ≥
')6
*