Common neighbour structure and similarity intensity in complex networks

Abstract Complex systems as networks always exhibit strong regularities, implying underlying mechanisms governing their evolution. In addition to the degree preference, the similarity has been argued to be another driver for networks. Assuming a network is randomly organised without similarity preference, the present paper studies the expected number of common neighbours between vertices. A symmetrical similarity index is accordingly developed by removing such expected number from the observed common neighbours. The developed index can not only describe the similarities between vertices, but also the dissimilarities. We further apply the proposed index to measure of the influence of similarity on the wring patterns of networks. Fifteen empirical networks as well as artificial networks are examined in terms of similarity intensity and degree heterogeneity. Results on real networks indicate that, social networks are strongly governed by the similarity as well as the degree preference, while the biological networks and infrastructure networks show no apparent similarity governance. Particularly, classical network models, such as the Barabasi–Albert model, the Erdos–Renyi model and the Ring Lattice, cannot well describe the social networks in terms of the degree heterogeneity and similarity intensity. The findings may shed some light on the modelling and link prediction of different classes of networks.

[1]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[2]  James P. Bagrow,et al.  Natural emergence of clusters and bursts in network evolution , 2012, Physical Review X.

[3]  Tao Zhou,et al.  Bootstrap percolation on spatial networks , 2014, Scientific Reports.

[4]  Linyuan Lü,et al.  Toward link predictability of complex networks , 2015, Proceedings of the National Academy of Sciences.

[5]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[6]  T. R. Grant,et al.  Dominance and association among members of a captive and a free-ranging group of grey kangaroos (Macropus giganteus) , 1973 .

[7]  Yi-Cheng Zhang,et al.  Collaborative filtering with diffusion-based similarity on tripartite graphs , 2009, ArXiv.

[8]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Jürgen Bajorath,et al.  Lessons learned from the design of chemical space networks and opportunities for new applications , 2016, Journal of Computer-Aided Molecular Design.

[10]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[11]  P. Lambin,et al.  Optical simulations of electron diffraction by carbon nanotubes , 2002 .

[12]  Jinzhu Zhang,et al.  Uncovering mechanisms of co-authorship evolution by multirelations-based link prediction , 2017, Inf. Process. Manag..

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

[14]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[15]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Alessandro Vespignani.  Modelling dynamical processes in complex socio-technical systems , 2011, Nature Physics.

[17]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[18]  Santo Fortunato,et al.  Characterizing and modeling the dynamics of online popularity , 2010, Physical review letters.

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

[20]  Tao Zhou,et al.  Measuring multiple evolution mechanisms of complex networks , 2014, Scientific Reports.

[21]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[22]  Ilya R. Fischhoff,et al.  Network metrics reveal differences in social organization between two fission–fusion species, Grevy’s zebra and onager , 2007, Oecologia.

[23]  An Zeng,et al.  Iterative resource allocation for ranking spreaders in complex networks , 2014 .

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

[25]  Carsten Wiuf,et al.  Subnets of scale-free networks are not scale-free: sampling properties of networks. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[26]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[28]  B. Bollobás.  The evolution of random graphs , 1984 .

[29]  Santo Fortunato,et al.  Scale-free network growth by ranking. , 2006, Physical review letters.

[30]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[31]  Seung Kee Han,et al.  Estimation of inter-modular connectivity from the local field potentials in a hierarchical modular network , 2015 .

[32]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[33]  Zhao-Long Hu,et al.  Effect of the social influence on topological properties of user-object bipartite networks , 2013 .

[34]  Klaus Lehnertz,et al.  Assortative mixing in functional brain networks during epileptic seizures , 2013, Chaos.

[35]  Jian Gao,et al.  A vertex similarity index for better personalized recommendation , 2015, 1510.02348.

[36]  Runtong Zhang,et al.  Solving the stability–accuracy–diversity dilemma of recommender systems , 2017 .

[37]  Mihyun Kang,et al.  On (ε,k)-min-wise independent permutations , 2007 .

[38]  Dan Cosley,et al.  Inferring social ties from geographic coincidences , 2010, Proceedings of the National Academy of Sciences.

[39]  Stephen P. Ficklin,et al.  Massive-Scale Gene Co-Expression Network Construction and Robustness Testing Using Random Matrix Theory , 2013, PloS one.

[40]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[41]  Qiang Guo,et al.  Stability of similarity measurements for bipartite networks , 2015, Scientific Reports.

[42]  Alexandre Vidmer,et al.  Information filtering via hybridization of similarity preferential diffusion processes , 2013, ArXiv.

[43]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[44]  Timothy Ravasi,et al.  From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks , 2013, Scientific Reports.

[45]  Lucy Skrabanek,et al.  PDZBase: a protein?Cprotein interaction database for PDZ-domains , 2005, Bioinform..

[46]  R. Quick,et al.  Thermal Conductivity of Copper Part II. Conductivity at Low Temperatures , 1895 .

[47]  Kecheng Liu,et al.  Social influence on selection behaviour: Distinguishing local- and global-driven preferential attachment , 2017, PloS one.

[48]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[49]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[50]  Alexandre Vidmer,et al.  Information filtering by similarity-preferential diffusion processes , 2014 .

[51]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[52]  P. Holme.  Core-periphery organization of complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[53]  Charalampos E. Tsourakakis.  Toward Quantifying Vertex Similarity in Networks , 2011, Internet Math..