Abstract
We argue that users in social networks are strategic in how they post and propagate information. We propose two models — greedy and courteous — and study information propagation both analytically and through simulations. For a suitable random graph model of a social network, we prove that news propagation follows a threshold phenomenon, hence, “high-quality” information provably spreads throughout the network assuming users are “greedy”. Starting from a sample of the Twitter graph, we show through simulations that the threshold phenomenon is exhibited by both the greedy and courteous user models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Compete – Site Comparison, http://siteanalytics.compete.com/facebook.com+google.com/?metric=uv
Facebook Statistics, http://www.facebook.com/press/info.php?statistics
Journalism Rules Are Bent in News Coverage From Iran, http://www.nytimes.com/2009/06/29/business/media/29coverage.html
Twitter Revolution in Iran, http://money.cnn.com/video/news/2009/06/22/n_twitter_revolution_iran_pentagon.cnnmoney
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. 7th ACM SIGKDD (2001)
Domingos, P., Richardson, M.: Mining knowledge-sharing sites for viral marketing. In: Proc. 8th ACM SIGKDD (2002)
Erdos, P., Renyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5 (1960)
Gupte, M., Hajiaghayi, M., Han, L., Iftode, L., Shankar, P., Ursu, R.M.: News posting by strategic users in a social network. Technical Report DCS-tr-657, Rutgers University, Department of Computer Science (October 2009)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. 9th ACM SIGKDD (2003)
Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: Proc. 15th ACM SIGKDD (2009)
Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using kronecker multiplication. In: International Conference on Machine Learning, ICML (2007)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: Densification laws, shrinking diameters and possible explanations. In: Proc. 11th ACM SIGKDD (2005)
Leskovec, J., Singh, A., Kleinberg, J.: Patterns of influence in a recommendation network. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 380–389. Springer, Heidelberg (2006)
Mahdian, M., Xu, Y.: Stochastic kronecker graphs. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 179–186. Springer, Heidelberg (2007)
Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Structures and Algorithms 6 (1995)
Morris, S.: Contagion. Review of Economic Studies 67 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupte, M., Hajiaghayi, M., Han, L., Iftode, L., Shankar, P., Ursu, R.M. (2009). News Posting by Strategic Users in a Social Network. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-10841-9_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10840-2
Online ISBN: 978-3-642-10841-9
eBook Packages: Computer ScienceComputer Science (R0)