IDEAS home Printed from https://ideas.repec.org/r/eee/phsmap/v451y2016icp205-212.html
   My bibliography  Save this item

Identifying influential spreaders in complex networks based on gravity formula

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Malang, Kanokwan & Wang, Shuliang & Phaphuangwittayakul, Aniwat & Lv, Yuanyuan & Yuan, Hanning & Zhang, Xiuzhen, 2020. "Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
  2. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
  3. Xiaojian Ma & Yinghong Ma, 2019. "The Local Triangle Structure Centrality Method to Rank Nodes in Networks," Complexity, Hindawi, vol. 2019, pages 1-16, January.
  4. Sun, Hong-liang & Chen, Duan-bing & He, Jia-lin & Ch’ng, Eugene, 2019. "A voting approach to uncover multiple influential spreaders on weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 303-312.
  5. Ai, Jun & He, Tao & Su, Zhan, 2023. "Identifying influential nodes in complex networks based on resource allocation similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 627(C).
  6. Yin, Ran-Ran & Guo, Qiang & Yang, Jian-Nan & Liu, Jian-Guo, 2018. "Inter-layer similarity-based eigenvector centrality measures for temporal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 165-173.
  7. Bao, Zhong-Kui & Ma, Chuang & Xiang, Bing-Bing & Zhang, Hai-Feng, 2017. "Identification of influential nodes in complex networks: Method from spreading probability viewpoint," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 391-397.
  8. Yang, Ming-Yuan & Wang, Chengjin & Wu, Zhen-Guo & Wu, Xin & Zheng, Chengsi, 2023. "Influential risk spreaders and their contribution to the systemic risk in the cryptocurrency network," Finance Research Letters, Elsevier, vol. 57(C).
  9. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
  10. Liu, Ying & Tang, Ming & Zhou, Tao & Do, Younghae, 2016. "Identify influential spreaders in complex networks, the role of neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 289-298.
  11. Guo, Haoming & Wang, Shuangling & Yan, Xuefeng & Zhang, Kecheng, 2024. "Node importance evaluation method of complex network based on the fusion gravity model," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
  12. Tao, Li & Kong, Shengzhou & He, Langzhou & Zhang, Fan & Li, Xianghua & Jia, Tao & Han, Zhen, 2022. "A sequential-path tree-based centrality for identifying influential spreaders in temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 165(P1).
  13. Pisit Jarumaneeroj & Amar Ramudhin & Jorge Barnett Lawton, 2023. "A connectivity-based approach to evaluating port importance in the global container shipping network," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(3), pages 602-622, September.
  14. Yu, Senbin & Gao, Liang & Xu, Lida & Gao, Zi-You, 2019. "Identifying influential spreaders based on indirect spreading in neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 418-425.
  15. Luo, Mengzhuo & Liu, Xinzhi & Zhong, Shouming & Cheng, Jun, 2018. "Synchronization of multi-stochastic-link complex networks via aperiodically intermittent control with two different switched periods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 20-38.
  16. Wang, Ying & Zheng, Yunan & Shi, Xuelei & Liu, Yiguang, 2022. "An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).
  17. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
  18. Liu, Qiang & Zhu, Yu-Xiao & Jia, Yan & Deng, Lu & Zhou, Bin & Zhu, Jun-Xing & Zou, Peng, 2018. "Leveraging local h-index to identify and rank influential spreaders in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 379-391.
  19. Yang, Xu-Hua & Xiong, Zhen & Ma, Fangnan & Chen, Xiaoze & Ruan, Zhongyuan & Jiang, Peng & Xu, Xinli, 2021. "Identifying influential spreaders in complex networks based on network embedding and node local centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 573(C).
  20. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
  21. Dong, Chen & Xu, Guiqiong & Meng, Lei & Yang, Pingle, 2022. "CPR-TOPSIS: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(C).
  22. Wang, Junyi & Hou, Xiaoni & Li, Kezan & Ding, Yong, 2017. "A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 88-105.
  23. Rupkumar Mahapatra & Sovan Samanta & Madhumangal Pal & Tofigh Allahviranloo & Antonios Kalampakas, 2024. "A Study on Linguistic Z-Graph and Its Application in Social Networks," Mathematics, MDPI, vol. 12(18), pages 1-24, September.
  24. Wang, Yan & Li, Haozhan & Zhang, Ling & Zhao, Linlin & Li, Wanlan, 2022. "Identifying influential nodes in social networks: Centripetal centrality and seed exclusion approach," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
  25. Bi, Jialin & Jin, Ji & Qu, Cunquan & Zhan, Xiuxiu & Wang, Guanghui & Yan, Guiying, 2021. "Temporal gravity model for important node identification in temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 147(C).
  26. Qu, Hongbo & Song, Yu-Rong & Li, Ruqi & Li, Min, 2023. "GNR: A universal and efficient node ranking model for various tasks based on graph neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P2).
  27. Wang, Jing & Ma, Xiao-Jing & Xiang, Bing-Bing & Bao, Zhong-Kui & Zhang, Hai-Feng, 2022. "Maximizing influence in social networks by distinguishing the roles of seeds," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
  28. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
  29. Gao, Xin & Ye, Yunxia & Su, Wenxin & Chen, Linyan, 2023. "Assessing the comprehensive importance of power grid nodes based on DEA," International Journal of Critical Infrastructure Protection, Elsevier, vol. 42(C).
  30. Ibnoulouafi, Ahmed & El Haziti, Mohamed, 2018. "Density centrality: identifying influential nodes based on area density formula," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 69-80.
  31. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
  32. Chi, Kuo & Qu, Hui & Yin, Guisheng, 2022. "Link prediction for existing links in dynamic networks based on the attraction force," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
  33. Li, Chao & Wang, Li & Sun, Shiwen & Xia, Chengyi, 2018. "Identification of influential spreaders based on classified neighbors in real-world complex networks," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 512-523.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.