Abstract
We study the problem of generalized degree-based percolation without memory, where the probability of node removal depends on a non-negative function of node degree within the remaining network. We derive a set of nonlinear ordinary differential equations describing the evolution of the degree distribution during the percolation process. Employing generating function methods, we calculate various quantities of interest such as the probability of a randomly selected node belonging to the giant component, the mean cluster size, and the critical point at which a network transitions from connected to fragmented. Validation of our approach is achieved through extensive Monte Carlo simulations and numerical solutions. Our results indicate that removing highly connected nodes with small preference probabilities significantly lowers the critical point compared to random removal. Moreover, our analytical framework is applicable to random networks generated by the configuration model with any bounded degree distribution. It provides a comprehensive and systematic approach to analyze network robustness against various degree-based attack strategies, offering valuable insights into network design and protection.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.