标题
A novel measure to identify influential nodes: Return Random Walk Gravity Centrality
作者
关键词
-
出版物
INFORMATION SCIENCES
Volume 628, Issue -, Pages 177-195
出版商
Elsevier BV
发表日期
2023-01-21
DOI
10.1016/j.ins.2023.01.097
参考文献
相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。- A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes
- (2022) Manuel Curado et al. Journal of Computational Science
- Graph regularization multidimensional projection
- (2022) Alcebiades Dal Col et al. PATTERN RECOGNITION
- An improved gravity model to identify influential nodes in complex networks based on k-shell method
- (2021) Xuan Yang et al. KNOWLEDGE-BASED SYSTEMS
- Identifying influential spreaders in complex networks based on network embedding and node local centrality
- (2021) Xu-Hua Yang et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Semi-supervised node classification via adaptive graph smoothing networks
- (2021) Ruigang Zheng et al. PATTERN RECOGNITION
- HNF: Hybrid Neural Filtering Based on Centrality-Aware Random Walk for Personalized Recommendation
- (2021) Shenghao Liu et al. IEEE Transactions on Network Science and Engineering
- Influential Nodes Identification in Complex Networks via Information Entropy
- (2020) Chungu Guo et al. Entropy
- An efficient approach to identify social disseminators for timely information diffusion
- (2020) Lien-Fa Lin et al. INFORMATION SCIENCES
- Top influencers can be identified universally by combining classical centralities
- (2020) Doina Bucur Scientific Reports
- Application of Complex Networks Theory in Urban Traffic Network Researches
- (2019) Rui Ding et al. NETWORKS & SPATIAL ECONOMICS
- Identifying influential spreaders by gravity model
- (2019) Zhe Li et al. Scientific Reports
- Quasi-Laplacian centrality: A new vertex centrality measurement based on Quasi-Laplacian energy of networks
- (2019) Yue Ma et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Analysis of the impact of online social networks addiction on the propagation of rumors
- (2019) Adil Imad Eddine Hosni et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Return random walks for link prediction
- (2019) Manuel Curado INFORMATION SCIENCES
- Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors
- (2019) Adil Imad Eddine Hosni et al. INFORMATION SCIENCES
- CAOM: A community-based approach to tackle opinion maximization for social networks
- (2019) Qiang He et al. INFORMATION SCIENCES
- Identification of influencers in complex networks by local information dimensionality
- (2019) Tao Wen et al. INFORMATION SCIENCES
- Revising the structure of Bayesian network classifiers in the presence of missing data
- (2018) Roosevelt Sardinha et al. INFORMATION SCIENCES
- Identifying Influential Nodes Based on Community Structure to Speed up the Dissemination of Information in Complex Network
- (2018) Muluneh Mekonnen Tulu et al. IEEE Access
- Identifying influential nodes in complex networks based on the inverse-square law
- (2018) Liguo Fei et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Dominating communities for hierarchical control of complex networks
- (2017) Peng Gang Sun et al. INFORMATION SCIENCES
- Centrality measures for networks with community structure
- (2016) Naveen Gupta et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Vital nodes identification in complex networks
- (2016) Linyuan Lü et al. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS
- A Community-Based Approach to Identifying Influential Spreaders
- (2015) Zhiying Zhao et al. Entropy
- Iterative resource allocation for ranking spreaders in complex networks
- (2014) Zhuo-Ming Ren et al. EPL
- The Hidden Geometry of Complex, Network-Driven Contagion Phenomena
- (2013) D. Brockmann et al. SCIENCE
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now