Random Walks-Based Node Centralities to Attack Complex Networks
Investigating the network response to node removal and the efficacy of the node removal strategies is fundamental to network science. Different research studies have proposed many node centralities based on the network structure for ranking nodes to remove. The random walk (RW) on networks describes...
Main Authors: | Massimiliano Turchetto, Michele Bellingeri, Roberto Alfieri, Ngoc-Kim-Khanh Nguyen, Quang Nguyen, Davide Cassi |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-11-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/23/4827 |
Similar Items
-
Forecasting real-world complex networks’ robustness to node attack using network structure indexes
by: Michele Bellingeri, et al.
Published: (2023-10-01) -
Modularity affects the robustness of scale-free model and real-world social networks under betweenness and degree-based node attack
by: Quang Nguyen, et al.
Published: (2021-11-01) -
Random Walks on Networks with Centrality-Based Stochastic Resetting
by: Kiril Zelenkovski, et al.
Published: (2023-02-01) -
New Random Walk Algorithm Based on Different Seed Nodes for Community Detection
by: Jiansheng Cai, et al.
Published: (2024-07-01) -
Quantum walk neural networks with feature dependent coins
by: Stefan Dernbach, et al.
Published: (2019-09-01)