2008/05/31 by J. -P. Kownacki, J-P Kownacki · 1 citation
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Continuum percolation theory #Critical exponent #Graph theory and applications #Percolation (cognitive psychology) #Percolation threshold #Planar #Random graph #Robustness (evolution) #Stochastic processes and statistical mechanics #Topology (electrical circuits) #cond-mat.stat-mech #hep-lat
paper · pdf · doi:10.1088/1742-5468/2008/07/p07024
published in Journal of Statistical Mechanics Theory and Experiment 2008(07), P07024 (Institute of Physics) · 9 pages, 11 figures. Added references.Corrected typos. Paragraph added in section II and in the conclusion. Published version
arxiv created 2008/07/25 · openalex publication_date 2008/07/25 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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.