Percolation on fitness-dependent networks with heterogeneous resilience

The ability to understand the impact of adversarial processes on networks is crucial to various disciplines. The objects of study in this article are fitness driven networks. Fitness dependent networks are fully described by a probability distribution of fitness and an attachment kernel. Every node in the network is endowed with a fitness value and the attachment kernel translates the fitness of two nodes into the probability that these two nodes share an edge. This concept is also known as mutual attractiveness. In the present article, fitness does not only serve as a measure of attractiveness, but also as a measure of a node’s robustness against failure. The probability that a node fails increases with the number of failures in its direct neighborhood and decreases with higher fitness. Both static and dynamic network models are considered. Analytical results for the percolation threshold and the occupied fraction are derived. One of the results is that the distinction between the dynamic and the static model has a profound impact on the way failures spread over the network. Additionally, we find that the introduction of mutual attractiveness stabilizes the network compared to a pure random attachment.