Identifying influential spreaders by weight degree centrality in complex networks
DOI10.1016/J.CHAOS.2016.01.030zbMATH Open1382.91067OpenAlexW2289334527WikidataQ57852359 ScholiaQ57852359MaRDI QIDQ508182FDOQ508182
Authors: Yuxian Du, Fuyuan Xiao, Yong Deng, Yang Liu, Bo Wei
Publication date: 10 February 2017
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2016.01.030
Recommendations
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Title not available (Why is that?)
- Collective dynamics of `small-world' networks
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- Betweenness in time dependent networks
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- Immunization strategy based on the critical node in percolation transition
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Ranking the spreading ability of nodes in complex networks based on local structure
- Identifying influential spreaders by weighted leaderrank
- Mean field theory of epidemic spreading with effective contacts on networks
- Adequate is better: particle swarm optimization with limited-information
- Optimal step-size of pseudo affine projection algorithm
- Statistical convergence behavior of affine projection algorithms
- An evidential opinion dynamics model based on heterogeneous social influential power
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
- Identifying influential spreaders in artificial complex networks
- A generalized gravity model for influential spreaders identification in complex networks
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- Rumor propagation controlling based on finding important nodes in complex network
- Influential nodes ranking in complex networks: an entropy-based approach
- 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)