Pages that link to "Item:Q1619389"
From MaRDI portal
The following pages link to Identifying influential spreaders in complex networks based on gravity formula (Q1619389):
Displaying 23 items.
- Identifying influential spreaders by weight degree centrality in complex networks (Q508182) (← links)
- New trends in influence maximization models (Q826341) (← links)
- Identification of influential nodes in complex networks: method from spreading probability viewpoint (Q1620311) (← links)
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition (Q1632565) (← links)
- A new evidential methodology of identifying influential nodes in complex networks (Q1681656) (← links)
- Density centrality: identifying influential nodes based on area density formula (Q2000310) (← links)
- Energy disruptive centrality with an application to criminal network (Q2025571) (← links)
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths (Q2121163) (← links)
- A generalized gravity model for influential spreaders identification in complex networks (Q2129411) (← links)
- Identifying influential spreaders in complex networks based on improved k-shell method (Q2139312) (← links)
- Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks (Q2161711) (← links)
- Epidemic behaviors in weighted networks with core-periphery structure (Q2161950) (← links)
- CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy (Q2162956) (← links)
- Maximizing influence in social networks by distinguishing the roles of seeds (Q2170594) (← links)
- Identifying influential spreaders in artificial complex networks (Q2341565) (← links)
- Identifying multiple influential spreaders by a heuristic clustering algorithm (Q2406128) (← links)
- Identification of influential spreaders based on classified neighbors in real-world complex networks (Q2423005) (← links)
- An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks (Q2668298) (← links)
- Identifying influential spreaders in complex networks through local effective spreading paths (Q3303063) (← links)
- M-Centrality: identifying key nodes based on global position and local degree variation (Q3303303) (← links)
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks (Q5067504) (← links)
- IDENTIFYING VITAL NODES IN COMPLEX NETWORK BY CONSIDERING MULTIPLEX INFLUENCES (Q6203428) (← links)
- Identifying influential nodes in complex networks based on network embedding and local structure entropy (Q6607285) (← links)
