Name
Title | ||
|---|---|---|
Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis |
Abstract | ||
|---|---|---|
We propose an algorithm to locate the most critical nodes to network
robustness. Such critical nodes may be thought of as those most related to the
notion of network centrality. Our proposal relies only on a localized spectral
analysis of a limited subnetwork centered at each node in the network. We also
present a procedure allowing the navigation from any node towards a critical
node following only local information computed by the proposed algorithm.
Experimental results confirm the effectiveness of our proposal considering
networks of different scales and topological characteristics. |
Year | Venue | Keywords |
|---|---|---|
2011 | Clinical Orthopaedics and Related Research | distributed algorithm |
Field | DocType | Volume |
Computer science,Brooks–Iyengar algorithm,Centrality,Computer network,Theoretical computer science,Robustness (computer science),Distributed algorithm,Spectral analysis,Subnetwork,Distributed computing | Journal | abs/1101.5 |
Citations | PageRank | References |
1 | 0.36 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus Wehmuth | 1 | 70 | 10.17 |
| Artur Ziviani | 2 | 646 | 56.62 |