Robustness and decentralized search in complex networks
Studies on complex networks have been motivated by the desire to better understand various real-life systems. Such systems, including Internet, world-wide web (WWW), airline transportation systems, food web, protein-protein reactions, co-authorship, and terrorist activities etc., when formulated int...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/42368 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Studies on complex networks have been motivated by the desire to better understand various real-life systems. Such systems, including Internet, world-wide web (WWW), airline transportation systems, food web, protein-protein reactions, co-authorship, and terrorist activities etc., when formulated into network models, display some nontrivial common features. For example, they all have heavy-tailed nodal-degree distributions, or in other words, all can be formulated into scale-free networks. Extensive research efforts have been made to study the robustness of complex networks especially scale-free networks. One of the most important results is that while scale-free networks are strongly tolerant against random failures, they are fragile under intentional attack which crashes network nodes in a decreasing order of their nodal degrees. |
|---|