A k-shell decomposition method for weighted networks
From MaRDI portal
Publication:5137692
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.
Recommendations
- Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
- Vital nodes identification by the hybrid \(K\)-shell method based on vertex strength
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying the node spreading influence with largest \(k\)-core values
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
Cites work
- scientific article; zbMATH DE number 158464 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Complex networks. Structure, robustness and function.
- Dynamical Processes on Complex Networks
- Economic networks: the new challenges
- Fast algorithms for determining (generalized) core groups in social networks
- Identifying sets of key players in a social network
- Networks. An introduction.
- Scale-Free Networks
- Social and economic networks.
- Statistical mechanics of complex networks
- The mathematics of infectious diseases
- The structural role of weak and strong links in a financial market network
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
Cited in
(18)- Core-periphery structure in networks (revisited)
- Ranking the spreading ability of nodes in complex networks based on local structure
- Core decomposition, maintenance and applications
- Identifying critical nodes in complex networks based on neighborhood information
- The role of network embeddedness on the selection of collaboration partners: an agent-based model with empirical validation
- Effects of human dynamics on epidemic spreading in Côte d'Ivoire
- MODELING SOCIAL RESILIENCE: QUESTIONS, ANSWERS, OPEN PROBLEMS
- Ranking in evolving complex networks
- Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
- Energy disruptive centrality with an application to criminal network
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- scientific article; zbMATH DE number 5630701 (Why is no real title available?)
- Multifractal analysis for core-periphery structure of complex networks
- Epidemic behaviors in weighted networks with core-periphery structure
- Sparsity of weighted networks: measures and applications
- Identifying influential spreaders in complex networks based on gravity formula
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- CONTROL CONTRIBUTION IDENTIFIES TOP DRIVER NODES IN COMPLEX NETWORKS
This page was built for publication: A \(k\)-shell decomposition method for weighted networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137692)
