We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^ε$ in the case when the power law exponent satisfies $β<1$. In the case when $β=1$, the lower bound is of the form $\log (n)^ε$. The embedding technique used in the proof could also be of independent interest.