MET: A fast algorithm for minimizing propagation in large graphs with small eigen-gaps

SIAM International Conference on Data Mining 2015, SDM 2015

Volumn , Issue , 2015, Pages 694-702

  Le, Long T ^a   Eliassi Rad, Tina ^a   Tong, Hanghang ^b  

^a RUTGERS UNIVERSITY   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; DATA MINING; EIGENVALUES AND EIGENFUNCTIONS; SPACE DIVISION MULTIPLE ACCESS; VIRUSES;

ADJACENCY MATRICES; ARBITRARY GRAPHS; CYBER SECURITY; FAST ALGORITHMS; INSTANT MESSAGING; LARGEST EIGENVALUES; MULTIPLE EIGENVALUES; SCALABLE ALGORITHMS;

GRAPH THEORY;

EID: 84961904764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611974010.78     Document Type: Conference Paper

References (13)

1. F. Bonchi. Influence propagation in social networks: A data mining perspective. In IEEE Intelligent Informatics Bulletin, page 2, 2011.
2. A. Brouwer and W. H. Haemers. Spectral of Graph. Springer, 2009.
3. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos. Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur., 10(4):1:1-1:26, 2008.
4. H. Chan, L. Akoglu, and H. Tong. Make it or break it: Manipulating robustness in large networks. In SDM, pages 325-333, 2014.
5. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
6. A. Goyal, F. Bonchi, L. V. S. Lakshmanan, and S. Venkata-subramanian. On minimizing budget and time in influence propagation over social networks. Social Netw. Analys. Mining, 3:179-192, 2013.
7. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
8. C. J. Kuhlman, G. Tuli, S. Swamp, M. V. Marathe, and S. S. Ravi. Blocking simple and complex contagion by edge removal. In ICDM, pages 399-408, 2013.
9. C. Lanczos. An iterative method for the solution of the eigenvalue problem of linear differential and integral. J. Res. Nat. Bur. Stand., pages 255-282, 1950.
10. B. A. Prakash, D. Chakrabarti, M. Faloutsos, N. Valler, and C. Faloutsos. Threshold conditions for arbitrary cascade models on arbitrary networks. In ICDM, pages 537-546, 2011.
11. G. W. Stewart and J.-G. Sun. Matrix Perturbation Theory. Academic Press, 1990.
12. H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos. Gelling, and melting, large graphs by edge manipulation. In CIKM, pages 245-254, 2012.
13. H. Tong, B. A. Prakash, C. Tsourakakis, T. Eliassi-Rad, C. Faloutsos, and D. H. Chau. On the vulnerability of large graphs. In ICDM, pages 1091-1096, 2010.