Identifying influential spreaders by weight degree centrality in complex networks
From MaRDI portal
(Redirected from Publication:508182)
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- Adequate is better: particle swarm optimization with limited-information
- An evidential opinion dynamics model based on heterogeneous social influential power
- Betweenness in time dependent networks
- Collective dynamics of `small-world' networks
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential spreaders by weighted leaderrank
- Immunization strategy based on the critical node in percolation transition
- Mean field theory of epidemic spreading with effective contacts on networks
- Optimal step-size of pseudo affine projection algorithm
- Ranking the spreading ability of nodes in complex networks based on local structure
- Statistical convergence behavior of affine projection algorithms
- THE TREATMENT OF TIES IN RANKING PROBLEMS
Cited in
(26)- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- Rank the spreading influence of nodes using dynamic Markov process
- A new local and multidimensional ranking measure to detect spreaders in social networks
- Identifying influential spreaders in complex networks based on gravity formula
- Identification of influential spreaders in bipartite networks: a singular value decomposition approach
- Identifying influential spreaders by weighted leaderrank
- A modified weighted TOPSIS to identify influential nodes in complex networks
- Dynamic malware containment under an epidemic model with alert
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
- Epidemic spreading over quenched networks with local behavioral response
- A generalized gravity model for influential spreaders identification in complex networks
- Identifying influential spreaders in artificial complex networks
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- Influential nodes ranking in complex networks: an entropy-based approach
- Rumor propagation controlling based on finding important nodes in complex network
- Dynamics in affinity-weighted preferential attachment networks
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- Identifying influential spreaders in complex networks based on improved k-shell method
- Identifying influential spreaders in complex networks through local effective spreading paths
- Identifying the node spreading influence with largest \(k\)-core values
- Identifying influential nodes in social networks: a voting approach
- 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 by rumor spreading on correlated networks through community identification
- Spreading dynamics in complex networks
This page was built for publication: Identifying influential spreaders by weight degree centrality in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508182)
