
134 Analyzing and Securing Social Networks
After some algebraic manipulations (Shi and Malik, 2000), we get
min (,)min
,CC
ii
y
T
T
ii
CC
yD
yDy
()
=
−
Ncut
(12.3)
subject to the constraints:
• y
i
∈ {1, −b}, for some constant −b, and
• 1: y
t
D1 = 0
Minimizing
yDy
DW
T
T
−
subject to the constraints above is NP-hard. It is important to note
here that the expression on the right side in Equation 12.3 is the Rayleigh quotient (Shi and Malik,
2000). To make the problem tractable, we relax the constraints on y, and allow it to take just real
values. The relaxed problem has the same solution as the generalized eigenvalue problem for the
second smallest genera ...