Density centrality: identifying influential nodes based on area density formula
From MaRDI portal
Publication:2000310
Recommendations
- A new measure of identifying influential nodes: efficiency centrality
- A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
- A new method for identifying influential nodes and important edges in complex networks
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks
Cites work
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential nodes in complex networks: a node information dimension approach
- Identifying influential spreaders in complex networks based on gravity formula
- Identifying the node spreading influence with largest \(k\)-core values
- Network of Thrones
- Network science. With Márton Pósfai
- Principles of Distributed Systems
Cited in
(3)
This page was built for publication: Density centrality: identifying influential nodes based on area density formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000310)