Slides - SNAP - Stanford University
Slides - SNAP - Stanford University
Slides - SNAP - Stanford University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
How big do we have to make p before we are<br />
likely to have no isolated nodes?<br />
We know: P[v has degree 0] = e -c<br />
Event we are asking about is:<br />
I = some node is isolated<br />
<br />
v∈N<br />
I = I where Iv is the event that v is isolated<br />
We have:<br />
v<br />
⎛<br />
P <br />
⎝ v∈N<br />
( I ) = P⎜<br />
I ⎟ ≤ P(<br />
I )<br />
v<br />
⎞<br />
⎠<br />
∑<br />
v∈N<br />
10/4/2011 Jure Leskovec, <strong>Stanford</strong> CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 14<br />
v<br />
=<br />
ne<br />
−c<br />
Union bound<br />
<br />
i<br />
A<br />
i<br />
∑<br />
≤ i<br />
A i<br />
A<br />
i