Understanding task-driven information flow in collaborative networks

Collaborative networks are a special type of social network formed by members who collectively achieve specific goals, such as fixing software bugs and resolving customers' problems. In such networks, information flow among members is driven by the tasks assigned to the network, and by the expertise of its members to complete those tasks. In this work, we analyze real-life collaborative networks to understand their common characteristics and how information is routed in these networks. Our study shows that collaborative networks exhibit significantly different properties compared with other complex networks. Collaborative networks have truncated power-law node degree distributions and other organizational constraints. Furthermore, the number of steps along which information is routed follows a truncated power-law distribution. Based on these observations, we developed a network model that can generate synthetic collaborative networks subject to certain structure constraints. Moreover, we developed a routing model that emulates task-driven information routing conducted by human beings in a collaborative network. Together, these two models can be used to study the efficiency of information routing for different types of collaborative networks -- a problem that is important in practice yet difficult to solve without the method proposed in this paper.

[1]  Louise E. Moser,et al.  Generative models for ticket resolution in expert networks , 2010, KDD.

[2]  Serge Galam,et al.  Modelling rumors: the no plane Pentagon French hoax case , 2002, cond-mat/0211571.

[3]  R. Taylor.  Contrained switchings in graphs , 1981 .

[4]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

[5]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[6]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[7]  S. Galam.  Minority opinion spreading in random geometry , 2002, cond-mat/0203553.

[8]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[9]  Suhan Ree.  Power-law distributions from additive preferential redistributions. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[12]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[13]  Paul Erdös,et al.  On random graphs, I , 1959 .

[14]  A Díaz-Guilera,et al.  Modeling diffusion of innovations in a social network. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Hanghang Tong,et al.  Information spreading in context , 2011, WWW.

[16]  Danuta Makowiec.  Evolving network – simulation study , 2005 .

[17]  D. Strang,et al.  DIFFUSION IN ORGANIZATIONS AND SOCIAL MOVEMENTS: From Hybrid Corn to Poison Pills , 1998 .

[18]  Krzysztof Malarz,et al.  Gossip in random networks , 2006 .

[19]  E. Rogers,et al.  Diffusion of innovations , 1964, Encyclopedia of Sport Management.

[20]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[21]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[22]  Marián Boguñá,et al.  Self-similarity of complex networks and hidden metric spaces , 2007, Physical review letters.

[23]  T. Valente,et al.  Network models of the diffusion of innovations , 1995, Comput. Math. Organ. Theory.

[24]  R. May,et al.  How Viruses Spread Among Computers and People , 2001, Science.

[25]  Ben Y. Zhao,et al.  Measurement-calibrated graph models for social network experiments , 2010, WWW '10.

[26]  Duncan J. Watts,et al.  Who says what to whom on twitter , 2011, WWW.

[27]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[28]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[29]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[30]  Thomas W. Valente.  Network models of the diffusion of innovations , 1996, Comput. Math. Organ. Theory.

[31]  Dmitri V. Krioukov,et al.  Erratum: Self-Similarity of Complex Networks and Hidden Metric Spaces [Phys. Rev. Lett. 100, 078701 (2008)] , 2008 .