Gelling, and melting, large graphs by edge manipulation

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

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

81 Citations (Scopus)

Abstract

Controlling the dissemination of an entity (e.g., meme, virus, etc) on a large graph is an interesting problem in many disciplines. Examples include epidemiology, computer security, marketing, etc. So far, previous studies have mostly focused on removing or inoculating nodes to achieve the desired outcome. We shift the problem to the level of edges and ask: which edges should we add or delete in order to speed-up or contain a dissemination? First, we propose effective and scalable algorithms to solve these dissemination problems. Second, we conduct a theoretical study of the two problems and our methods, including the hardness of the problem, the accuracy and complexity of our methods, and the equivalence between the different strategies and problems. Third and lastly, we conduct experiments on real topologies of varying sizes to demonstrate the effectiveness and scalability of our approaches.

Original languageEnglish (US)
Title of host publicationACM International Conference Proceeding Series
Pages245-254
Number of pages10
DOIs
StatePublished - 2012
Externally publishedYes
Event21st ACM International Conference on Information and Knowledge Management, CIKM 2012 - Maui, HI, United States
Duration: Oct 29 2012Nov 2 2012

Other

Other21st ACM International Conference on Information and Knowledge Management, CIKM 2012
CountryUnited States
CityMaui, HI
Period10/29/1211/2/12

Fingerprint

Epidemiology
Security of data
Viruses
Scalability
Marketing
Melting
Hardness
Topology
Experiments

Keywords

  • edge manipulation
  • graph mining
  • immunization
  • scalability

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Tong, H., Prakash, B. A., Eliassi-Rad, T., Faloutsos, M., & Faloutsos, C. (2012). Gelling, and melting, large graphs by edge manipulation. In ACM International Conference Proceeding Series (pp. 245-254) https://doi.org/10.1145/2396761.2396795

Gelling, and melting, large graphs by edge manipulation. / Tong, Hanghang; Prakash, B. Aditya; Eliassi-Rad, Tina; Faloutsos, Michalis; Faloutsos, Christos.

ACM International Conference Proceeding Series. 2012. p. 245-254.

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

Tong, H, Prakash, BA, Eliassi-Rad, T, Faloutsos, M & Faloutsos, C 2012, Gelling, and melting, large graphs by edge manipulation. in ACM International Conference Proceeding Series. pp. 245-254, 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, Maui, HI, United States, 10/29/12. https://doi.org/10.1145/2396761.2396795
Tong H, Prakash BA, Eliassi-Rad T, Faloutsos M, Faloutsos C. Gelling, and melting, large graphs by edge manipulation. In ACM International Conference Proceeding Series. 2012. p. 245-254 https://doi.org/10.1145/2396761.2396795
Tong, Hanghang ; Prakash, B. Aditya ; Eliassi-Rad, Tina ; Faloutsos, Michalis ; Faloutsos, Christos. / Gelling, and melting, large graphs by edge manipulation. ACM International Conference Proceeding Series. 2012. pp. 245-254
@inproceedings{277864559dbc4fe1a9713ba9a445bd64,
title = "Gelling, and melting, large graphs by edge manipulation",
abstract = "Controlling the dissemination of an entity (e.g., meme, virus, etc) on a large graph is an interesting problem in many disciplines. Examples include epidemiology, computer security, marketing, etc. So far, previous studies have mostly focused on removing or inoculating nodes to achieve the desired outcome. We shift the problem to the level of edges and ask: which edges should we add or delete in order to speed-up or contain a dissemination? First, we propose effective and scalable algorithms to solve these dissemination problems. Second, we conduct a theoretical study of the two problems and our methods, including the hardness of the problem, the accuracy and complexity of our methods, and the equivalence between the different strategies and problems. Third and lastly, we conduct experiments on real topologies of varying sizes to demonstrate the effectiveness and scalability of our approaches.",
keywords = "edge manipulation, graph mining, immunization, scalability",
author = "Hanghang Tong and Prakash, {B. Aditya} and Tina Eliassi-Rad and Michalis Faloutsos and Christos Faloutsos",
year = "2012",
doi = "10.1145/2396761.2396795",
language = "English (US)",
isbn = "9781450311564",
pages = "245--254",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Gelling, and melting, large graphs by edge manipulation

AU - Tong, Hanghang

AU - Prakash, B. Aditya

AU - Eliassi-Rad, Tina

AU - Faloutsos, Michalis

AU - Faloutsos, Christos

PY - 2012

Y1 - 2012

N2 - Controlling the dissemination of an entity (e.g., meme, virus, etc) on a large graph is an interesting problem in many disciplines. Examples include epidemiology, computer security, marketing, etc. So far, previous studies have mostly focused on removing or inoculating nodes to achieve the desired outcome. We shift the problem to the level of edges and ask: which edges should we add or delete in order to speed-up or contain a dissemination? First, we propose effective and scalable algorithms to solve these dissemination problems. Second, we conduct a theoretical study of the two problems and our methods, including the hardness of the problem, the accuracy and complexity of our methods, and the equivalence between the different strategies and problems. Third and lastly, we conduct experiments on real topologies of varying sizes to demonstrate the effectiveness and scalability of our approaches.

AB - Controlling the dissemination of an entity (e.g., meme, virus, etc) on a large graph is an interesting problem in many disciplines. Examples include epidemiology, computer security, marketing, etc. So far, previous studies have mostly focused on removing or inoculating nodes to achieve the desired outcome. We shift the problem to the level of edges and ask: which edges should we add or delete in order to speed-up or contain a dissemination? First, we propose effective and scalable algorithms to solve these dissemination problems. Second, we conduct a theoretical study of the two problems and our methods, including the hardness of the problem, the accuracy and complexity of our methods, and the equivalence between the different strategies and problems. Third and lastly, we conduct experiments on real topologies of varying sizes to demonstrate the effectiveness and scalability of our approaches.

KW - edge manipulation

KW - graph mining

KW - immunization

KW - scalability

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

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

U2 - 10.1145/2396761.2396795

DO - 10.1145/2396761.2396795

M3 - Conference contribution

SN - 9781450311564

SP - 245

EP - 254

BT - ACM International Conference Proceeding Series

ER -