Make it or break it

Manipulating robustness in large networks

Hau Chan, Leman Akoglu, Hanghang Tong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

The function and performance of networks rely on their robustness, defined as their ability to continue functioning in the face of damage (targeted attacks or random failures) to parts of the network. Prior research has proposed a variety of measures to quantify robustness and various manipulation strategies to alter it. In this paper, our contributions are twofold. First, we critically analyze various robustness measures and identify their strengths and weaknesses. Our analysis suggests natural connectivity, based on the weighted count of loops in a network, to be a reliable measure. Second, we propose the first principled manipulation algorithms that directly optimize this robustness measure, which lead to significant performance improvement over existing, ad-hoc heuristic solutions. Extensive experiments on real-world datasets demonstrate the effectiveness and scalability of our methods against a long list of competitor strategies.

Original languageEnglish (US)
Title of host publicationSIAM International Conference on Data Mining 2014, SDM 2014
PublisherSociety for Industrial and Applied Mathematics Publications
Pages325-333
Number of pages9
Volume1
ISBN (Print)9781510811515
DOIs
StatePublished - 2014
Externally publishedYes
Event14th SIAM International Conference on Data Mining, SDM 2014 - Philadelphia, United States
Duration: Apr 24 2014Apr 26 2014

Other

Other14th SIAM International Conference on Data Mining, SDM 2014
CountryUnited States
CityPhiladelphia
Period4/24/144/26/14

Fingerprint

Scalability
Experiments

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Cite this

Chan, H., Akoglu, L., & Tong, H. (2014). Make it or break it: Manipulating robustness in large networks. In SIAM International Conference on Data Mining 2014, SDM 2014 (Vol. 1, pp. 325-333). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611973440.37

Make it or break it : Manipulating robustness in large networks. / Chan, Hau; Akoglu, Leman; Tong, Hanghang.

SIAM International Conference on Data Mining 2014, SDM 2014. Vol. 1 Society for Industrial and Applied Mathematics Publications, 2014. p. 325-333.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chan, H, Akoglu, L & Tong, H 2014, Make it or break it: Manipulating robustness in large networks. in SIAM International Conference on Data Mining 2014, SDM 2014. vol. 1, Society for Industrial and Applied Mathematics Publications, pp. 325-333, 14th SIAM International Conference on Data Mining, SDM 2014, Philadelphia, United States, 4/24/14. https://doi.org/10.1137/1.9781611973440.37
Chan H, Akoglu L, Tong H. Make it or break it: Manipulating robustness in large networks. In SIAM International Conference on Data Mining 2014, SDM 2014. Vol. 1. Society for Industrial and Applied Mathematics Publications. 2014. p. 325-333 https://doi.org/10.1137/1.9781611973440.37
Chan, Hau ; Akoglu, Leman ; Tong, Hanghang. / Make it or break it : Manipulating robustness in large networks. SIAM International Conference on Data Mining 2014, SDM 2014. Vol. 1 Society for Industrial and Applied Mathematics Publications, 2014. pp. 325-333
@inproceedings{70d0142d2a534469802aca78d2fd22a6,
title = "Make it or break it: Manipulating robustness in large networks",
abstract = "The function and performance of networks rely on their robustness, defined as their ability to continue functioning in the face of damage (targeted attacks or random failures) to parts of the network. Prior research has proposed a variety of measures to quantify robustness and various manipulation strategies to alter it. In this paper, our contributions are twofold. First, we critically analyze various robustness measures and identify their strengths and weaknesses. Our analysis suggests natural connectivity, based on the weighted count of loops in a network, to be a reliable measure. Second, we propose the first principled manipulation algorithms that directly optimize this robustness measure, which lead to significant performance improvement over existing, ad-hoc heuristic solutions. Extensive experiments on real-world datasets demonstrate the effectiveness and scalability of our methods against a long list of competitor strategies.",
author = "Hau Chan and Leman Akoglu and Hanghang Tong",
year = "2014",
doi = "10.1137/1.9781611973440.37",
language = "English (US)",
isbn = "9781510811515",
volume = "1",
pages = "325--333",
booktitle = "SIAM International Conference on Data Mining 2014, SDM 2014",
publisher = "Society for Industrial and Applied Mathematics Publications",

}

TY - GEN

T1 - Make it or break it

T2 - Manipulating robustness in large networks

AU - Chan, Hau

AU - Akoglu, Leman

AU - Tong, Hanghang

PY - 2014

Y1 - 2014

N2 - The function and performance of networks rely on their robustness, defined as their ability to continue functioning in the face of damage (targeted attacks or random failures) to parts of the network. Prior research has proposed a variety of measures to quantify robustness and various manipulation strategies to alter it. In this paper, our contributions are twofold. First, we critically analyze various robustness measures and identify their strengths and weaknesses. Our analysis suggests natural connectivity, based on the weighted count of loops in a network, to be a reliable measure. Second, we propose the first principled manipulation algorithms that directly optimize this robustness measure, which lead to significant performance improvement over existing, ad-hoc heuristic solutions. Extensive experiments on real-world datasets demonstrate the effectiveness and scalability of our methods against a long list of competitor strategies.

AB - The function and performance of networks rely on their robustness, defined as their ability to continue functioning in the face of damage (targeted attacks or random failures) to parts of the network. Prior research has proposed a variety of measures to quantify robustness and various manipulation strategies to alter it. In this paper, our contributions are twofold. First, we critically analyze various robustness measures and identify their strengths and weaknesses. Our analysis suggests natural connectivity, based on the weighted count of loops in a network, to be a reliable measure. Second, we propose the first principled manipulation algorithms that directly optimize this robustness measure, which lead to significant performance improvement over existing, ad-hoc heuristic solutions. Extensive experiments on real-world datasets demonstrate the effectiveness and scalability of our methods against a long list of competitor strategies.

UR - http://www.scopus.com/inward/record.url?scp=84959885192&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959885192&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973440.37

DO - 10.1137/1.9781611973440.37

M3 - Conference contribution

SN - 9781510811515

VL - 1

SP - 325

EP - 333

BT - SIAM International Conference on Data Mining 2014, SDM 2014

PB - Society for Industrial and Applied Mathematics Publications

ER -