Extending assortativity: An application to weighted social networks

Abstract Assortativity by degree for complex networks is quantified by the Newman coefficient, and it describes a tendency for nodes to be connected to others with a similar degree. A generalization of the assortativity index has been proposed in the literature for undirected and unweighted networks, analysing the correlation between vertices that are not necessarily adjacent, but connected through paths, shortest paths and random walks. The aim of this study is to define a new class of higher-order assortativity measures for weighted networks. The effectiveness of these measures is evident in social networks, where both weights and connections are significant. Applications to Facebook and co-authorship networks are provided, analysing the assortativity beyond the nearest neighbours.

[1]  Leto Peel,et al.  The ground truth about metadata and community detection in networks , 2016, Science Advances.

[2]  Lars K. Hansen,et al.  Second-Order Assortative Mixing in Social Networks , 2009, 0903.0687.

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  Ela Ozkan-Canbolat,et al.  A configurational approach to network topology design for product innovation , 2016 .

[5]  Natarajan Meghanathan,et al.  Assortativity Analysis of Real-World Network Graphs based on Centrality Metrics , 2016, Comput. Inf. Sci..

[6]  Patrick Gunnigle,et al.  Mapping networks: Exploring the utility of social network analysis in management research and practice , 2017 .

[7]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Piet Van Mieghem,et al.  Assortativity in complex networks , 2015, J. Complex Networks.

[9]  S. Borgatti,et al.  Making Invisible Work Visible: Using Social Network Analysis to Support Strategic Collaboration , 2002 .

[10]  M. Newman.  Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[12]  Robin I. M. Dunbar.  Social Brain Hypothesis , 1998, Encyclopedia of Evolutionary Psychological Science.

[13]  Jean-Charles Delvenne,et al.  Multiscale mixing patterns in networks , 2017, Proceedings of the National Academy of Sciences.

[14]  Martin G. Everett,et al.  Network analysis of 2-mode data , 1997 .

[15]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[16]  Hang-Hyun Jo,et al.  Generalized friendship paradox in complex networks: The case of scientific collaboration , 2014, Scientific Reports.

[17]  P. Van Mieghem,et al.  Influence of assortativity and degree-preserving rewiring on the spectra of networks , 2010 .

[18]  Piotr Sapiezynski,et al.  Evidence for a conserved quantity in human mobility , 2016, Nature Human Behaviour.

[19]  Louise Young,et al.  On cooperating: firms, relations and networks☆ , 2002 .

[20]  Preetam Ghosh,et al.  Long-range degree correlations in complex networks , 2015 .

[21]  Bei-Bei Su,et al.  Assortativity and act degree distribution of some collaboration networks , 2007 .

[22]  Alberto Arcagni,et al.  Higher order assortativity in complex networks , 2016, Eur. J. Oper. Res..

[23]  C. Leung,et al.  Weighted assortative and disassortative networks model , 2006, physics/0607134.

[24]  Matteo Cinelli,et al.  Generalized Rich-Club Ordering in Networks , 2018, J. Complex Networks.