Percolation models shed a light on network integrity and functionality and have numerous applications in network theory. This paper studies a targeted percolation (αmodel) with incomplete knowledge where the highest degree node in a randomly selected set of n nodes is removed at each step, and the model features a tunable probability that the removed node is instead a random one. A “mirror image” process (β model) in which the target is the lowest degree node is also investigated. We analytically calculate the giant component size, the critical occupation probability, and the scaling law for the percolation threshold with respect to the knowledge level n under both models. We also derive self consistency equations to analyze the k-core organization including the size of the k core and its corona in the context of attacks under tunable limited knowledge. These percolation models are characterized by some interesting critical phenomena and reveal profound quantitative structure discrepancies between Erdős-Rényi networks and power-law networks.
|Number of pages||9|
|Journal||Physical Review E - Statistical, Nonlinear, and Soft Matter Physics|
|Early online date||28 Apr 2021|
|Publication status||Published - Apr 2021|