Identifying and ranking influential spreaders in complex networks by neighborhood coreness
From MaRDI portal
Publication:1782576
DOI10.1016/j.physa.2013.10.047zbMath1395.92139OpenAlexW2040763707MaRDI QIDQ1782576
Publication date: 20 September 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2013.10.047
Epidemiology (92D30) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items
Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths, Investigating the relationship between \(k\)-core and \(s\)-core network decompositions, Identifying influential spreaders in complex networks based on gravity formula, Identification of influential nodes in complex networks: method from spreading probability viewpoint, New trends in influence maximization models, Influence Maximization in Complex Networks Through Supervised Machine Learning, Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition, Identifying influential spreaders in complex networks based on improved k-shell method, Compressive sensing of high betweenness centrality nodes in networks, GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks, A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition, A new method for centrality measurement using generalized fuzzy graphs, Identifying influential nodes in social networks: a voting approach, Identifying multiple influential spreaders by a heuristic clustering algorithm, A novel method of evaluating key nodes in complex networks, An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks, A new evidential methodology of identifying influential nodes in complex networks, Syncretic K-shell algorithm for node importance identification and invulnerability evaluation of urban rail transit network, Identification of influential spreaders based on classified neighbors in real-world complex networks, Influential nodes ranking in complex networks: an entropy-based approach, Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks, IDENTIFYING VITAL NODES IN COMPLEX NETWORK BY CONSIDERING MULTIPLEX INFLUENCES, Influential node detection of social networks based on network invulnerability, Dismantling complex networks based on the principal eigenvalue of the adjacency matrix, A new local and multidimensional ranking measure to detect spreaders in social networks, High-order degree and combined degree in complex networks, Identifying the node spreading influence with largest \(k\)-core values, Core Decomposition, Maintenance and Applications, M-Centrality: identifying key nodes based on global position and local degree variation, Identifying influential spreaders by weight degree centrality in complex networks, Density centrality: identifying influential nodes based on area density formula, Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient, A new method for identifying influential nodes and important edges in complex networks, Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks, Evaluation of community vulnerability based on communicability and structural dissimilarity, Identifying vital nodes in hypernetwork based on local centrality
Cites Work
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- Fast algorithms for determining (generalized) core groups in social networks
- The centrality index of a graph
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Ak-shell decomposition method for weighted networks
- Collective dynamics of ‘small-world’ networks
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- THE TREATMENT OF TIES IN RANKING PROBLEMS
