Cost of Collaboration vs Individual Effort in Social Networks

We study the dynamics of social networks in terms of population growth and control of user behavior. Most of the current research in social networks focus on static analysis through graph theoretic models to represent the networks or focus on modeling the traffic. Here, we study the cost of collaborative vs individualistic behavior of users in order to grow their network size in a social network. Each user incurs a cost (monetary or emotional) for collaboration. We formulate the behavior of the users as a non-linear optimization problem with a cost. The objective function of the optimization problem is obtained using a stochastic analysis of population growth in social networks, based on the first-passage time of a birth-death process. The stochastic model is validated by comparison with real data obtained from Twitter Results indicate that a homogeneous social network (in which users have similar characteristics) will be individualistic. However, heterogeneous social networks (users with different characteristics) exhibit a threshold effect, i.e., there is a minimum cost, below which the network is as collaborative as desired and a maximum cost above which the network is individualistic as required. To the best of our knowledge, this is one of the first analysis of dynamics of user behavior and temporal population growth in social networks.

[1]  Stephen P. Borgatti,et al.  Ethical and Strategic Issues in Organizational Social Network Analysis , 2003 .

[2]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[3]  J. Boissevain The Place of Non-Groups in the Social Sciences , 1968 .

[4]  B. Cornwell The Dynamic Properties of Social Support: Decay, Growth, and Staticity, and Their Effects on Adolescent Depression , 2003 .

[5]  Yihong Gong,et al.  Directed Network Community Detection: A Popularity and Productivity Link Model , 2010, SDM.

[6]  Duncan J. Watts,et al.  Characterizing individual communication patterns , 2009, KDD.

[7]  Xiaowei Ying,et al.  On Randomness Measures for Social Networks , 2009, SDM.

[8]  Li Ding,et al.  Analyzing Social Networks on the Semantic Web , 2005 .

[9]  Ning Chen,et al.  On the approximability of influence in social networks , 2008, SODA '08.

[10]  David Jensen,et al.  Data Mining in Social Networks , 2002 .

[11]  R. Burt The Social Structure of Competition , 2004 .

[12]  K. P. Subbalakshmi,et al.  Twitter analytics: Architecture, tools and analysis , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[13]  Seungyeop Han,et al.  Analysis of topological characteristics of huge online social networking services , 2007, WWW '07.

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[16]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[17]  Zongpeng Li,et al.  Youtube traffic characterization: a view from the edge , 2007, IMC '07.

[18]  Daniel P. Heyman,et al.  Modeling multiple IP traffic streams with rate limits , 2003, TNET.

[19]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[20]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[21]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[22]  Bernardo A. Huberman,et al.  Assessing the value of cooperation in Wikipedia , 2007, First Monday.

[23]  Balachander Krishnamurthy,et al.  Network level footprints of facebook applications , 2009, IMC '09.

[24]  Keith W. Ross,et al.  P2P Trading in Social Networks: The Value of Staying Connected , 2010, 2010 Proceedings IEEE INFOCOM.