Identifying and ranking influential spreaders in complex networks by neighborhood coreness
From MaRDI portal
Publication:1782576
DOI10.1016/J.PHYSA.2013.10.047zbMATH Open1395.92139OpenAlexW2040763707MaRDI QIDQ1782576FDOQ1782576
Authors: Joonhyun Bae, Sang Wook Kim 
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
Recommendations
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
- Identification of influential spreaders based on classified neighbors in real-world complex networks
Epidemiology (92D30) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Collective dynamics of `small-world' networks
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- The centrality index of a graph
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Fast algorithms for determining (generalized) core groups in social networks
- A \(k\)-shell decomposition method for weighted networks
Cited In (47)
- Targeted \(k\)-node collapse problem: towards understanding the robustness of local \(k\)-core structure
- Identifying critical nodes in complex networks based on neighborhood information
- Influential node detection of social networks based on network invulnerability
- New trends in influence maximization models
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- A new local and multidimensional ranking measure to detect spreaders in social networks
- M-centrality: identifying key nodes based on global position and local degree variation
- Identifying influential spreaders in complex networks based on gravity formula
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
- Identifying vital nodes in hypernetwork based on local centrality
- Identifying influential spreaders by weighted leaderrank
- A new metric to quantify influence of nodes in social networks
- A novel method of evaluating key nodes in complex networks
- Density centrality: identifying influential nodes based on area density formula
- Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- A new evidential methodology of identifying influential nodes in complex networks
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
- High-order degree and combined degree in complex networks
- Identifying influential spreaders in artificial complex networks
- A \(k\)-shell decomposition method for weighted networks
- Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
- Influential nodes ranking in complex networks: an entropy-based approach
- Identifying influential nodes in complex networks based on network embedding and local structure entropy
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- Identifying influential spreaders in complex networks based on improved k-shell method
- Compressive sensing of high betweenness centrality nodes in networks
- Syncretic K-shell algorithm for node importance identification and invulnerability evaluation of urban rail transit network
- An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks
- A new method for centrality measurement using generalized fuzzy graphs
- Identifying the node spreading influence with largest \(k\)-core values
- Identifying influential nodes in social networks: a voting approach
- IDENTIFYING VITAL NODES IN COMPLEX NETWORK BY CONSIDERING MULTIPLEX INFLUENCES
- Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
- Identification of influential spreaders based on classified neighbors in real-world complex networks
- New metrics for influential spreaders identification in complex networks based on D-spectra of nodes
- Influence Maximization in Complex Networks Through Supervised Machine Learning
- Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks
- Identifying influential spreaders by weight degree centrality in complex networks
- Spreading dynamics in complex networks
- Evaluation of community vulnerability based on communicability and structural dissimilarity
- A new method for identifying influential nodes and important edges in complex networks
- Core decomposition, maintenance and applications
- A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
This page was built for publication: Identifying and ranking influential spreaders in complex networks by neighborhood coreness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782576)
