Ranking the spreading ability of nodes in complex networks based on local structure
From MaRDI portal
Publication:1782730
Recommendations
- A new local and multidimensional ranking measure to detect spreaders in social networks
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- A new measure of identifying influential nodes: efficiency centrality
Cites work
- A k-shell decomposition method for weighted networks
- A faster algorithm for betweenness centrality*
- A NEW MEASURE OF RANK CORRELATION
- A new status index derived from sociometric analysis
- Authoritative sources in a hyperlinked environment
- Collective dynamics of `small-world' networks
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 1324225 (Why is no real title available?)
- Phase transitions in social networks
- Statistical mechanics of complex networks
- The centrality index of a graph
- The mathematics of infectious diseases
Cited in
(24)- A modified weighted TOPSIS to identify influential nodes in 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
- A new measure of identifying influential nodes: efficiency centrality
- Identifying influential spreaders in complex networks based on improved k-shell method
- Identifying influential nodes in complex networks based on AHP
- Scalable influence maximization based on influential seed successors
- A new centrality measure based on random walks for multilayer networks under the framework of tensor computation
- Target users' activation probability maximization with different seed set constraints in social networks
- Co-ranking for nodes, layers and timestamps in multilayer temporal networks
- Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
- A new local and multidimensional ranking measure to detect spreaders in social networks
- Efficiency centrality in time-varying graphs
- Community based acceptance probability maximization for target users on social networks: algorithms and analysis
- A novel method of evaluating key nodes in complex networks
- A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks
- A new method for identifying influential nodes and important edges in complex networks
- Identifying influential spreaders by weight degree centrality in complex networks
- Epidemic centrality -- is there an underestimated epidemic impact of network peripheral nodes?
- A comparison of centrality measures and their role in controlling the spread in epidemic networks
- Node center identification in complex networks based on Jensen-Shannon divergence
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks
- Entropy-based semi-local centrality for identifying key nodes in weighted complex networks
- PageRank centrality for temporal networks
This page was built for publication: Ranking the spreading ability of nodes in complex networks based on local structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782730)
