Power-Law Random Graphs’ Robustness: Link Saving and Forest Fire Model
Marina Leri, Yury Pavlov
Austrian Journal of Statistics · 2014
doi:10.17713/ajs.v43i4.34 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
References19
19 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.