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

Austrian Journal of Statistics

article

Marina Leri¹  Yury Pavlov¹ 

[1] Institute of Applied MathematicalResearch of the Karelian Research CentreRussian Academy of Sciences

关键词: random graphs;    power-law distribution;    robustness;    simulation modeling;    forestfire model.;   

DOI  :  10.17713/ajs.v43i4.34

学科分类：医学（综合）

来源: Austrian Statistical Society

【 摘 要 】

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.

【 授权许可】

CC BY