Percolation of attack with tunable limited knowledge

Yilun Shang
Phys. Rev. E 103, 042316 – Published 28 April 2021

Abstract

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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 22 December 2020
  • Accepted 6 April 2021

DOI:https://doi.org/10.1103/PhysRevE.103.042316

©2021 American Physical Society

Physics Subject Headings (PhySH)

Networks

Authors & Affiliations

Yilun Shang

  • Department of Computer and Information Sciences, Northumbria University, Newcastle upon Tyne NE1 8ST, United Kingdom

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 103, Iss. 4 — April 2021

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×