Abstract
The diffusion of information is taking place every place and every time over the Internet. The widely used web applications of online social networks, have many benefits to serve as a medium for fast, widespread information diffusion platforms. While there is a substantial works on how to maximize the diffusion of useful information, there are many misinformation diffusing on social networks. How to control the misinformation diffusing efficiently with the smallest cost is still a big challenge. We tackle this challenge by reducing the problem to finding the critical blocks. The critical blocks are the sets of nodes that partition the whole network evenly at a small cost, and we believe they play a key role during the process of diffusion. We prove such problem of finding critical blocks is NP-complete and therefore an exact solution is infeasible to get. A simple but effective solution is proposed by the following steps: first we convert a social network graph into a Laplacian matrix, then we compute its Fiedler Vector, which has been proved to have good properties, with the help of Fiedler Vector, we develop some heuristic algorithms to find critical blocks. We also perform lots of experiments both on synthetic data and real world datasets of Twitter, the experimental results show that our algorithm is effective and efficient both on synthetic data and real world data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C.: Social Network Data Analytics. Springer Press, Germany (2011)
Ahuja, G.: Collaboration networks, structural holes, and innovation: A longitudinal study. Administrative Science Quarterly 45, 425–455 (2000)
Bapat, R.B.: Graphs and Matrices. Springer, Germany (2011)
Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Scinece 509(286) (1999)
Borgatti, S.P., Mehra, A., Brass, D.J., Labianca, G.: Network analysis in the social sciences. Science 323(5916), 892–895 (2009)
Budak, C., Agrawal, D., Abbadi, A.: Limiting the spread of misinformation in social networks. In: WWW 2011, pp. 497–505. ACM (March 2011)
Burt, R.: Structural Holes: The Social Structure of Competition. Harvard University Press, Cambridge (1992)
Pinto, P.C., Thiran, P., Vetterli, M.: Locating the Source of Diffusion in Large-Scale Networks. Physical Review Letters. Week Ending (August 10, 2012)
Fiedler, M.: A property of enginvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25(100), 619–633 (1975)
Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. Johns Hopkins University Press, USA (1996)
Gomez-Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. In: KDD 2010, pp. 1019–1028. ACM (July 2010)
Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: A data-based approach to social influence maximization. In: VLDB 2012, pp. 73–84. ACM (2012)
Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD 2003. ACM (2003)
Kleinberg, J., Suri, S., Tardos, E.: Strategic network formation with structural holes. In: EC 2008: ACM Conference on Electronic Commerce. ACM (July 2008)
Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: KDD 2007, pp. 497–505. ACM (July 2007)
Leskovec, J., Krause, A., Guestrin, C., et al.: Cost-effective outbreak detection in network. In: KDD 2007, pp. 420–429. ACM (2007)
Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design 19(2) (September 1992)
Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustreing: Analysis and an algorithm. In: NIPS 2001. ACM (March 2001)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8) (August 2000)
Thakar, J., Christensen, C., Albert, R.: Toward understanding the structure and function of cellular interaction networks. In: Handbook of Large-Scale Random Networks. Springer Press, Germany (2008)
von Luxburg, U.: A tutorial on spectral clustering. Stat. and Comp. 17(4) (2007)
Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, England (1994)
Watts, D.J., Strogatz, S.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, E., Wang, G., Gao, K., Yu, G. (2013). Finding Critical Blocks of Information Diffusion in Social Networks. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)