Eigen-optimization on large graphs by edge manipulation

Chen Chen, Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, Christos Faloutsos

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Large graphs are prevalent in many applications and enable a variety of information dissemination processes, e.g., meme, virus, and influence propagation. How can we optimize the underlying graph structure to affect the outcome of such dissemination processes in a desired way (e.g., stop a virus propagation, facilitate the propagation of a piece of good idea, etc)? Existing research suggests that the leading eigenvalue of the underlying graph is the key metric in determining the so-called epidemic threshold for a variety of dissemination models. In this paper, we study the problem of how to optimally place a set of edges (e.g., edge deletion and edge addition) to optimize the leading eigenvalue of the underlying graph, so that we can guide the dissemination process in a desired way. We propose effective, scalable algorithms for edge deletion and edge addition, respectively. In addition, we reveal the intrinsic relationship between edge deletion and node deletion problems. Experimental results validate the effectiveness and efficiency of the proposed algorithms.

Original languageEnglish (US)
Article number49
JournalACM Transactions on Knowledge Discovery from Data
Volume10
Issue number4
DOIs
StatePublished - Jun 1 2016

Fingerprint

Viruses
Information dissemination

Keywords

  • Edge manipulation
  • Graph mining
  • Immunization
  • Scalability

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Chen, C., Tong, H., Prakash, B. A., Eliassi-Rad, T., Faloutsos, M., & Faloutsos, C. (2016). Eigen-optimization on large graphs by edge manipulation. ACM Transactions on Knowledge Discovery from Data, 10(4), [49]. https://doi.org/10.1145/2903148

Eigen-optimization on large graphs by edge manipulation. / Chen, Chen; Tong, Hanghang; Prakash, B. Aditya; Eliassi-Rad, Tina; Faloutsos, Michalis; Faloutsos, Christos.

In: ACM Transactions on Knowledge Discovery from Data, Vol. 10, No. 4, 49, 01.06.2016.

Research output: Contribution to journalArticle

Chen, C, Tong, H, Prakash, BA, Eliassi-Rad, T, Faloutsos, M & Faloutsos, C 2016, 'Eigen-optimization on large graphs by edge manipulation', ACM Transactions on Knowledge Discovery from Data, vol. 10, no. 4, 49. https://doi.org/10.1145/2903148
Chen, Chen ; Tong, Hanghang ; Prakash, B. Aditya ; Eliassi-Rad, Tina ; Faloutsos, Michalis ; Faloutsos, Christos. / Eigen-optimization on large graphs by edge manipulation. In: ACM Transactions on Knowledge Discovery from Data. 2016 ; Vol. 10, No. 4.
@article{77a776eb4fc841a6b3bc218fc964ff03,
title = "Eigen-optimization on large graphs by edge manipulation",
abstract = "Large graphs are prevalent in many applications and enable a variety of information dissemination processes, e.g., meme, virus, and influence propagation. How can we optimize the underlying graph structure to affect the outcome of such dissemination processes in a desired way (e.g., stop a virus propagation, facilitate the propagation of a piece of good idea, etc)? Existing research suggests that the leading eigenvalue of the underlying graph is the key metric in determining the so-called epidemic threshold for a variety of dissemination models. In this paper, we study the problem of how to optimally place a set of edges (e.g., edge deletion and edge addition) to optimize the leading eigenvalue of the underlying graph, so that we can guide the dissemination process in a desired way. We propose effective, scalable algorithms for edge deletion and edge addition, respectively. In addition, we reveal the intrinsic relationship between edge deletion and node deletion problems. Experimental results validate the effectiveness and efficiency of the proposed algorithms.",
keywords = "Edge manipulation, Graph mining, Immunization, Scalability",
author = "Chen Chen and Hanghang Tong and Prakash, {B. Aditya} and Tina Eliassi-Rad and Michalis Faloutsos and Christos Faloutsos",
year = "2016",
month = "6",
day = "1",
doi = "10.1145/2903148",
language = "English (US)",
volume = "10",
journal = "ACM Transactions on Knowledge Discovery from Data",
issn = "1556-4681",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Eigen-optimization on large graphs by edge manipulation

AU - Chen, Chen

AU - Tong, Hanghang

AU - Prakash, B. Aditya

AU - Eliassi-Rad, Tina

AU - Faloutsos, Michalis

AU - Faloutsos, Christos

PY - 2016/6/1

Y1 - 2016/6/1

N2 - Large graphs are prevalent in many applications and enable a variety of information dissemination processes, e.g., meme, virus, and influence propagation. How can we optimize the underlying graph structure to affect the outcome of such dissemination processes in a desired way (e.g., stop a virus propagation, facilitate the propagation of a piece of good idea, etc)? Existing research suggests that the leading eigenvalue of the underlying graph is the key metric in determining the so-called epidemic threshold for a variety of dissemination models. In this paper, we study the problem of how to optimally place a set of edges (e.g., edge deletion and edge addition) to optimize the leading eigenvalue of the underlying graph, so that we can guide the dissemination process in a desired way. We propose effective, scalable algorithms for edge deletion and edge addition, respectively. In addition, we reveal the intrinsic relationship between edge deletion and node deletion problems. Experimental results validate the effectiveness and efficiency of the proposed algorithms.

AB - Large graphs are prevalent in many applications and enable a variety of information dissemination processes, e.g., meme, virus, and influence propagation. How can we optimize the underlying graph structure to affect the outcome of such dissemination processes in a desired way (e.g., stop a virus propagation, facilitate the propagation of a piece of good idea, etc)? Existing research suggests that the leading eigenvalue of the underlying graph is the key metric in determining the so-called epidemic threshold for a variety of dissemination models. In this paper, we study the problem of how to optimally place a set of edges (e.g., edge deletion and edge addition) to optimize the leading eigenvalue of the underlying graph, so that we can guide the dissemination process in a desired way. We propose effective, scalable algorithms for edge deletion and edge addition, respectively. In addition, we reveal the intrinsic relationship between edge deletion and node deletion problems. Experimental results validate the effectiveness and efficiency of the proposed algorithms.

KW - Edge manipulation

KW - Graph mining

KW - Immunization

KW - Scalability

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

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

U2 - 10.1145/2903148

DO - 10.1145/2903148

M3 - Article

AN - SCOPUS:84976349037

VL - 10

JO - ACM Transactions on Knowledge Discovery from Data

JF - ACM Transactions on Knowledge Discovery from Data

SN - 1556-4681

IS - 4

M1 - 49

ER -