Assortativity and clustering of sparse random intersection graphs

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for  the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the expected number of common neighbours of adjacent nodes, and  the expected degree of a neighbour of a node of a given degree k. These expressions are written in terms of the asymptotic degree distribution and, alternatively, in terms of the parameters defining the underlying random graph model.

[1]  Mindaugas Bloznelis Degree distribution of a typical vertex in a general random intersection graph , 2008 .

[2]  Stefanie Gerke,et al.  Connectivity of the uniform random intersection graph , 2008, Discret. Math..

[3]  Willemien Kets,et al.  RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING , 2009, Probability in the Engineering and Informational Sciences.

[4]  Armand M. Makowski,et al.  Zero–One Laws for Connectivity in Random Key Graphs , 2009, IEEE Transactions on Information Theory.

[5]  Dudley Stark The vertex degree distribution of random intersection graphs , 2004, Random Struct. Algorithms.

[6]  Maurizio Vichi,et al.  Studies in Classification Data Analysis and knowledge Organization , 2011 .

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

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

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

[10]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[11]  M. Newman Properties of highly clustered networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Jean-Loup Guillaume,et al.  Bipartite structure of all complex networks , 2004, Inf. Process. Lett..

[13]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[14]  Gesine Reinert,et al.  The shortest distance in random multi‐type intersection graphs , 2010, Random Struct. Algorithms.

[15]  Katarzyna Rybarczyk,et al.  Diameter, connectivity, and phase transition of the uniform random intersection graph , 2011, Discret. Math..

[16]  Andreas N. Lagerås,et al.  Epidemics on Random Graphs with Tunable Clustering , 2007, Journal of Applied Probability.

[17]  J. Steele Le Cam's inequality and poisson approximations , 1994 .

[18]  Erhard Godehardt,et al.  Two Models of Random Intersection Graphs and their Applications , 2001, Electron. Notes Discret. Math..

[19]  Michael Behrisch,et al.  Component Evolution in Random Intersection Graphs , 2007, Electron. J. Comb..

[20]  Mindaugas Bloznelis,et al.  Degree and clustering coefficient in sparse random intersection graphs , 2013, 1303.3388.

[21]  Erhard Godehardt,et al.  Clustering Coefficients of Random Intersection Graphs , 2010, GfKl.

[22]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[23]  Edward R. Scheinerman,et al.  On Random Intersection Graphs: The Subgraph Problem , 1999, Combinatorics, Probability and Computing.

[24]  Jerzy Jaworski,et al.  The Vertex Degree Distribution of Passive Random Intersection Graph Models , 2008, Combinatorics, Probability and Computing.

[25]  Hawoong Jeong,et al.  Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Erhard Godehardt,et al.  Two Models of Random Intersection Graphs for Classification , 2003 .

[27]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[28]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Paul G. Spirakis,et al.  On the independence number and Hamiltonicity of uniform random intersection graphs , 2011, Theor. Comput. Sci..