J-P Kownacki J. Stat. Mech. (2008) P07024 doi:10.1088/1742-5468/2008/07/P07024
J-P Kownacki
Show affiliationsIn this paper, robustness of planar trivalent random graphs to targeted attacks of the 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.
E-print Number: 0805.4285
Cited: by |
Refers: to
02.10.Ox Combinatorics; graph theory
05.50.+q Lattice theory and statistics (Ising, Potts, etc.)
82B43 Percolation (See also 60K35)
82B80 Numerical methods (Monte Carlo, series resummation, etc.) (See also 65-XX, 81T80)
Issue 07 (July 2008)
Received 28 May 2008, accepted for publication 6 July 2008
Published 25 July 2008
J-P Kownacki J. Stat. Mech. (2008) P07024
Jan de Gier and Fabian H L Essler J. Stat. Mech. (2006) P12011
A Puglisi et al J. Stat. Mech. (2007) P08016
Adriano Barra and Luca De Sanctis J. Stat. Mech. (2007) P08025
Pascal Baseilhac and Kozo Koizumi J. Stat. Mech. (2005) P10005
Jamila Rahmoun et al J. Stat. Mech. (2008) P06011
H J Hilhorst et al J. Stat. Mech. (2004) P10002
Jing Hu et al J. Stat. Mech. (2009) P02066
Peter Tass et al 2010 J. Neural Eng. 7 016009
Laurent Boué et al J. Stat. Mech. (2009) P11010