Modified pruning process algorithm for k-cores decomposition in a complex networks

The most commonly used algorithm for extracting k-cores of complex networks (CNs) is analyzed. The main drawback of this algorithm is identified, which is the possibility of degenerating the k-core into an empty set even if this network contains a sufficiently large number of nodes with a degree not less than k. To eliminate this drawback, a modified pruning process algorithm is proposed and its effectiveness for extracting k-cores is shown on the examples of a number of model and real-world complex networks. k-cores are formed as groups of the most important CN elements, which can become the target of simultaneous targeted attack on the network, and a scenario of such attack is formed, which takes into account the potential capabilities of intruder. A method for evaluation the consequences of successful attack on k-core is proposed, which is based on the concept of its neighborhood domain.