Measuring diversity of network models using distorted information diffusion process

In this paper, we propose a distorted information diffusion protocol to detect diversity of different network models. The protocol is inspired by the fact that, in real social networks, the information diffusion get influenced by the property of nodes and conduct of the links. Thus, information get deformed/distorted during diffusion process and true amount of information from a spreader never reach to all the nodes in the network. We consider a single spreader which has maximum degree in the network. We divide the entire network in to different layers where the nodes in a layer are defined by the nodes having a fixed distance from the spreader. We observe that the amount of information available at every node in a layer after the diffusion process reaches to saturation, is not equal. Thus, we define density of information profile of a layer that measures the density of information available in a layer. Finally, we define a vector, which we call information diversity vector whose components are density of information of the layers. The dimension of the diversity vector is the number of layers in the entire network. We implement the protocol in standard network models which include Albert-Barabasi preferential attachment Model (ABM), Hierarchical network generation Model (HM), and Watts-Strogatz Model (WSM). We also simulate the protocol in real world networks which include ego-Facebook Network, Collaboration network of ArXiv General Relativity, and Collaboration network of ArXiv High Energy Physics Theory. The simulated results show that the information diversity vectors of ABM and HM is far from reflecting the same in real world networks. However, diversity vector of WSM is similar to that of real world networks which we consider in this paper.

[1]  L. Allen Some discrete-time SI, SIR, and SIS epidemic models. , 1994, Mathematical biosciences.

[2]  Christos Faloutsos,et al.  Patterns of Cascading Behavior in Large Blog Graphs , 2007, SDM.

[3]  W. Marsden I and J , 2012 .

[4]  A. Barab Deterministic scale-free networks , 2007 .

[5]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[6]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[7]  P. ERDbS ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH , 2001 .

[8]  Guillermo Ricardo Simari,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 2000 .

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

[10]  J A Jacquez,et al.  The stochastic SI model with recruitment and deaths. I. Comparison with the closed SIS model. , 1993, Mathematical biosciences.

[11]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[12]  S. Mahadevan,et al.  Identifying influential nodes in weighted networks based on evidence theory , 2013 .

[13]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

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

[15]  Jon M. Kleinberg,et al.  Tracing information flow on a global scale using Internet chain-letter data , 2008, Proceedings of the National Academy of Sciences.

[16]  An Zeng,et al.  Ranking spreaders by decomposing complex networks , 2012, ArXiv.

[17]  R. Rosenfeld Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[18]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[19]  Duanbing Chen,et al.  Path diversity improves the identification of influential spreaders , 2013, ArXiv.

[20]  J A Jacquez,et al.  Reproduction numbers and thresholds in stochastic epidemic models. I. Homogeneous populations. , 1991, Mathematical biosciences.

[21]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[22]  Jure Leskovec,et al.  Meme-tracking and the dynamics of the news cycle , 2009, KDD.

[23]  Qiang Guo,et al.  Ranking the spreading influence in complex networks , 2013, ArXiv.

[24]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Christos Faloutsos,et al.  Modeling Blog Dynamics , 2009, ICWSM.

[26]  B. Kahng,et al.  Geometric fractal growth model for scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Xiaoge Zhang,et al.  A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks , 2013, PloS one.

[28]  Przemyslaw Kazienko,et al.  Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach , 2014, New Generation Computing.

[29]  Christos Faloutsos,et al.  Cascading Behavior in Large Blog Graphs , 2007 .

[30]  Krishna P. Gummadi,et al.  Measuring User Influence in Twitter: The Million Follower Fallacy , 2010, ICWSM.