Weitere Kapitel dieses Buchs durch Wischen aufrufen
Networks portray a multitude of interactions through which people meet, ideas are spread, and infectious diseases and malicious rumors propagate within a society. Recently, researchers have found that unsolicited malicious attacks spread extremely fast through influential spreaders. For example, in April 23, 2013, the twitter account of Associated Press was hacked to spread the rumor that explosions at White House injured Obama. This led to both the DOW Jones industrial average and Standard & Poor’s 500 Index plunging about 1% before regaining their losses. Hence, identifying the most efficient ‘spreaders’ in a network becomes an important step towards restraining spread of malicious attacks. In this chapter, we investigate the methods of measuring influence of network nodes.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
L. A. N. Amaral, A. Scala, M. Barthelemy, and H. E. Stanley. Classes of small-world networks. Proceedings of the National Academy of Sciences, 97(21):11149–11152, 2000. CrossRef
E. Bakshy, J. M. Hofman, W. A. Mason, and D. J. Watts. Everyone’s an influencer: Quantifying influence on twitter. In Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, WSDM ’11, pages 65–74, New York, NY, USA, 2011. ACM.
S. Bhagat, A. Goyal, and L. V. Lakshmanan. Maximizing product adoption in social networks. In Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, WSDM ’12, pages 603–612. ACM, 2012.
P. Bonacich. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1):113–120, 1972. CrossRef
W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’09, pages 199–208. ACM, 2009.
C. H. Comin and L. da Fontoura Costa. Identifying the starting point of a spreading process in complex networks. Phys. Rev. E, 84:056105, Nov 2011.
C. I. Del Genio, T. Gross, and K. E. Bassler. All scale-free networks are sparse. Phys. Rev. Lett., 107:178701, Oct 2011.
B. Doerr, M. Fouz, and T. Friedrich. Why rumors spread so quickly in social networks. Commun. ACM, 55(6):70–75, June 2012. CrossRef
P. Domingos and M. Richardson. Mining the network value of customers. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’01, pages 57–66. ACM, 2001.
H. Ebel, L.-I. Mielsch, and S. Bornholdt. Scale-free topology of e-mail networks. Phys. Rev. E, 66:035103, Sep 2002.
P. Erd0s. Graph theory and probability. Canad. J. Math, 11:34G38, 1959.
X. Fan and Y. Xiang. Modeling the propagation of peer-to-peer worms. Future Generation Computer Systems, 26(8):1433–1443, 2010. CrossRef
L. C. Freeman. A set of measures of centrality based upon betweenness. Sociometry, 40:35–41, 1977. CrossRef
L. C. Freeman. Centrality in social networks: conceptual clarification. Social Networks, 1:215–239, 1979. CrossRef
H. Jeong, S. P. Mason, A. L. Barabasi, and Z. N. Oltvai. Lethality and centrality in protein networks. Nature, 411(6833):41–42, May 2001. CrossRef
S. Jitesh and A. Jafar. The enron email dataset database schema and brief statistical report. Technical report, University of Southern California, 2009.
D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’03, pages 137–146, 2003.
M. Kitsak, L. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. Stanley, and H. Makse. Identification of influential spreaders in complex networks. Nature Physics, 6(11):888–893, Aug 2010. CrossRef
M. Mathioudakis, F. Bonchi, C. Castillo, A. Gionis, and A. Ukkonen. Sparsification of influence networks. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’11, pages 529–537. ACM, 2011.
M. E. Newman. A measure of betweenness centrality based on random walks. Social networks, 27(1):39–54, 2005. CrossRef
M. E. J. Newman. Networks: An Introduction, chapter 17 Epidemics on networks, pages 700–750. Oxford University Press, 2010.
F. Peter. ‘bogus’ ap tweet about explosion at the white house wipes billions off us markets, April 23 2013. Washington.
B. Vladimir and M. Andrej. Pajek: analysis and visualization of large networks. In GRAPH DRAWING SOFTWARE, pages 77–103. Springer, 2003.
Y. Wang, G. Cong, G. Song, and K. Xie. Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’10, pages 1039–1048. ACM, 2010.
Y. Wang, S. Wen, Y. Xiang, and W. Zhou. Modeling the propagation of worms in networks: A survey. Communications Surveys Tutorials, IEEE, 16(2):942–960, Second 2014. CrossRef
D. J. Watts and S. H. Strogatz. Collective dynamics of ‘small-world’ networks. nature, 393(6684):440–442, 1998. CrossRef
S. Wen, J. Jiang, B. Liu, Y. Xiang, and W. Zhou. Using epidemic betweenness to measure the influence of users in complex networks. Journal of Network and Computer Applications, 78:288–299, 2017. CrossRef
S. Wen, J. Jiang, Y. Xiang, S. Yu, and W. Zhou. Are the popular users always important for the information dissemination in online social networks? Network, IEEE, pages 1–3, October 2014.
S. Wen, W. Zhou, Y. Wang, W. Zhou, and Y. Xiang. Locating defense positions for thwarting the propagation of topological worms. Communications Letters, IEEE, 16(4):560–563, 2012. CrossRef
S. Wen, W. Zhou, J. Zhang, Y. Xiang, W. Zhou, and W. Jia. Modeling propagation dynamics of social network worms. Parallel and Distributed Systems, IEEE Transactions on, 24(8):1633–1643, 2013. CrossRef
S. Wen, W. Zhou, J. Zhang, Y. Xiang, W. Zhou, W. Jia, and C. Zou. Modeling and analysis on the propagation dynamics of modern email malware. Dependable and Secure Computing, IEEE Transactions on, 11(4):361–374, July 2014. CrossRef
G. Yan, G. Chen, S. Eidenbenz, and N. Li. Malware propagation in online social networks: nature, dynamics, and defense implications. In Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, ASIACCS’11, pages 196–206, 2011.
Y. Yan, Y. Qian, H. Sharif, and D. Tipper. A survey on smart grid communication infrastructures: Motivations, requirements and challenges. Communications Surveys Tutorials, IEEE, 15(1):5–20, First 2013. CrossRef
C. C. Zou, D. Towsley, and W. Gong. Modeling and simulation study of the propagation and defense of internet e-mail worms. IEEE Transactions on dependable and secure computing, 4(2):105–118, 2007. CrossRef
- User Influence in the Propagation of Malicious Attacks
- Chapter 3
Neuer Inhalt/© ITandMEDIA, Best Practices für die Mitarbeiter-Partizipation in der Produktentwicklung/© astrosystem | stock.adobe.com