A k-shell decomposition method for weighted networks

DOI10.1088/1367-2630/14/8/083030zbMATH Open1448.90023arXiv1205.3720OpenAlexW3105091379WikidataQ57259016 ScholiaQ57259016MaRDI QIDQ5137692FDOQ5137692

Authors: Frank Schweitzer, Antonios Garas, Shlomo Havlin 

Publication date: 2 December 2020

Published in: New Journal of Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1205.3720

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Financial networks (including contagion, systemic risk, regulation) (91G45)

Cites Work

• Statistical mechanics of complex networks
• The mathematics of infectious diseases
• Collective dynamics of `small-world' networks
• Networks. An introduction.
• Identifying sets of key players in a social network
• Title not available (Why is that?)
• Scale-Free Networks
• Dynamical Processes on Complex Networks
• Social and economic networks.
• Economic networks: the new challenges
• Complex networks. Structure, robustness and function.
• Title not available (Why is that?)
• The structural role of weak and strong links in a financial market network
• Fast algorithms for determining (generalized) core groups in social networks
• \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases

Cited In (18)

• Identifying critical nodes in complex networks based on neighborhood information
• Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
• Identifying influential spreaders in complex networks based on gravity formula
• Ranking the spreading ability of nodes in complex networks based on local structure
• Effects of human dynamics on epidemic spreading in Côte d'Ivoire
• Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
• Epidemic behaviors in weighted networks with core-periphery structure
• Core-periphery structure in networks (revisited)
• Energy disruptive centrality with an application to criminal network
• Ranking in evolving complex networks
• Title not available (Why is that?)
• Multifractal analysis for core-periphery structure of complex networks
• MODELING SOCIAL RESILIENCE: QUESTIONS, ANSWERS, OPEN PROBLEMS
• Sparsity of weighted networks: measures and applications
• The role of network embeddedness on the selection of collaboration partners: an agent-based model with empirical validation
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• CONTROL CONTRIBUTION IDENTIFIES TOP DRIVER NODES IN COMPLEX NETWORKS
• Core decomposition, maintenance and applications

Uses Software

• MCODE

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)