Network integrity and non-random removal of nodes

Thu Nov 21 19:14:32 UTC 2002

>>> "Sean" ==   <sgorman1 at gmu.edu> writes:

    Sean> it says nothing about what will happen to the other 91.7% of
    Sean> nodes.   Considering that  55%  of the  remaining nodes  are
    Sean> trees, they will be saying  "Houston we have a problem" well
    Sean> before 25%.

The  supposition  would  be   that  the  remaining  nodes  are  evenly
distributed around the core so  the percentage of nodes outside of the
core without connectivity should be roughly the same as the percentage
of  nodes  removed  from  the  core.  At least  until  the  core  goes
non-linear...

    >> It would be  interesting to see what outdegree  looks like as a
    >> function of rank -- in the paper they give only the maximum and
    >> average (geo. mean) outdegrees.  Is there also a critical point
    >> 25% of the way through  the ranking?  Probably not or one would
    >> expect they'd have mentioned it...

It turns  out that this is  buried in one  of the graphs (fig.  6) and
does not appear to have any special properties 25% of the way through.
It does have an inflection point around the 1000th node or so (2.5%).

-w