A k-shell decomposition method for weighted networks

Abstract

We present a generalized method for calculating the k-shell structure of weighted networks. The method takes into account both the weight and the degree of a network, in such a way that in the absence of weights we resume the shell structure obtained by the classic k-shell decomposition. In the presence of weights, we show that the method is able to partition the network in a more refined way, without the need of any arbitrary threshold on the weight values. Furthermore, by simulating spreading processes using the susceptible-infectious-recovered model in four different weighted real-world networks, we show that the weighted k-shell decomposition method ranks the nodes more accurately, by placing nodes with higher spreading potential into shells closer to the core. In addition, we demonstrate our new method on a real economic network and show that the core calculated using the weighted k-shell method is more meaningful from an economic perspective when compared with the unweighted one.

17 pages, 6 figures

References in corpus (9)

• Finding community structure in networks using the eigenvectors of matrices
• Statistical physics of social dynamics
• Prediction and predictability of global epidemics: the role of the airline transportation network
• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• New Model of Internet Topology Using k-shell Decomposition
• Network Physiology reveals relations between network topology and physiological function
• The backbone of the climate network
• Worldwide spreading of economic crisis
• The structural role of weak and strong links in a financial market network

Cited by in corpus (2)

• Ranking spreaders by decomposing complex networks
• Interplay of network dynamics and ties heterogeneity on spreading dynamics