A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs

From MaRDI portal
(Redirected from Publication:4642741)



Abstract: The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or susceptible. At each round every susceptible vertex which has at least rgeq2 infected neighbours becomes infected and remains so forever. Assume that initially a(t) vertices are randomly infected, where t is the total number of vertices of the graph. Suppose also that r<m, where 2m is the average degree. We determine a critical function ac(t) such that when a(t)ggac(t), complete infection occurs with high probability as tightarrowinfty, but when a(t)llac(t), then with high probability the process evolves only for a bounded number of rounds and the final set of infected vertices is asymptotically equal to a(t).












This page was built for publication: A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642741)