Robustness of planar random graphs to targeted attacks

Abstract

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.

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

References in corpus (13)

• Statistical mechanics of complex networks
• Error and attack tolerance of complex networks
• Network robustness and fragility: Percolation on random graphs
• 2D Gravity and Random Matrices
• Percolation Critical Exponents in Scale-Free Networks
• Transfer Matrix Formalism for Two-Dimensional Quantum Gravity and Fractal Structures of Space-time
• Scaling in quantum gravity
• World-Sheet Geometry and Baby Universes in 2-D Quantum Gravity
• Percolation in Hierarchical Scale-Free Nets
• Percolation transition in networks with degree-degree correlation
• The Harris-Luck criterion for random lattices
• Numerical evaluation of the upper critical dimension of percolation in scale-free networks
• Site Percolation on Planar ${\Phi }^3$ Random Graphs