Robustness of planar random graphs to targeted attacks

Details Robustness of planar random graphs to targeted attacks Robustness of planar random graphs to targeted attacks

2008-05-28

arxiv.org/abs/0805.4285v2

J. Stat. Mech. (2008) P07024

Physics

Condensed Matter

Statistical Mechanics

9 pages, 11 figures. Added references.Corrected typos. Paragraph added in section II and in the conclusion. Published version

Scientific paper

10.1088/1742-5468/2008/07/P07024

In this paper, robustness of planar trivalent random graphs to targeted attacks of highest connected nodes is investigated using numerical simulations. It is shown that these graphs are relatively robust. The nonrandom node removal process of targeted attacks is also investigated as a special case of non-uniform site percolation. Critical exponents are calculated by measuring various properties of the distribution of percolation clusters. They are found to be roughly compatible with critical exponents of uniform percolation on these graphs.

Affiliated with

Also associated with

No associations

Rating

Robustness of planar random graphs to targeted attacks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness of planar random graphs to targeted attacks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of planar random graphs to targeted attacks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416208