科研之友
微信
新浪微博
Facebook
分享链接
摘要
We study the following bootstrap percolation process: given a connected graph G , a constant ρ ∈ [0,1] and an initial set A ? V ( G ) of infected vertices, at each step a vertex v becomes infected if at least a ρ ‐proportion of its neighbors are already infected (once infected, a vertex remains infe...
