Power-Law Random Graphs’ Robustness: Link Saving and Forest Fire Model

  • Marina Leri Institute of Applied Mathematical Research of the Karelian Research Centre Russian Academy of Sciences
  • Yury Pavlov Institute of Applied Mathematical Research of the Karelian Research Centre Russian Academy of Sciences

Abstract

We consider random graphs with node degrees drawn independently from a power- law distribution. By computer simulation we study two aspects of graph robustness: preserving graph connectivity and node saving in the forest fire model, considering two types of graph destruction: the removal of nodes with the highest degrees and equiprobable node extraction. 

Published
2014-06-11
How to Cite
Leri, M., & Pavlov, Y. (2014). Power-Law Random Graphs’ Robustness: Link Saving and Forest Fire Model. Austrian Journal of Statistics, 43(4), 229-236. https://doi.org/10.17713/ajs.v43i4.34
Section
Articles