Clustering function: another view on clustering coefficient

Assuming that actors u and v have r common neighbors in a social network we are interested in how likely is that u and v are adjacent. This question is addressed by studying the collection of conditional probabilities, denoted cl(r), r = 0, 1, 2, . . . , that two randomly chosen actors of the social network are adjacent, given that they have r common neighbors. The function r → cl(r) describes clustering properties of the network and extends the global clustering coefficient. Our empirical study shows that the function r → cl(r) exhibits a typical sigmoid pattern. In order to better understand this pattern we establish the large scale asymptotics of cl(·) for two related random intersection graph models of affiliation networks admitting a non-vanishing global clustering coefficient. key words: Clustering coefficient, social network, affiliation network, clustering function, random intersection graph.

[1]  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.

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

[3]  Mindaugas Bloznelis,et al.  Component Evolution in General Random Intersection Graphs , 2010, SIAM J. Discret. Math..

[4]  Jean-Loup Guillaume,et al.  Bipartite graphs as models of complex networks , 2006 .

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

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

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

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

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

[10]  Mason A. Porter,et al.  Community Structure in Online Collegiate Social Networks , 2008 .

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

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

[13]  Erhard Godehardt,et al.  Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs , 2013, ECDA.

[14]  Lucas C. Parra,et al.  Origins of power-law degree distribution in the heterogeneity of human activity in social networks , 2013, Scientific Reports.

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

[16]  Armand M. Makowski,et al.  Random Key Graphs Can They be Small Worlds? , 2009, 2009 First International Conference on Networks & Communications.

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

[18]  Christos H. Papadimitriou,et al.  Modeling Social Networks through User Background and Behavior , 2011, WAW.

[19]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[21]  Valentas Kurauskas,et al.  Clustering function: a measure of social influence , 2012, ArXiv.

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

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

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

[25]  Dudley Stark.  The vertex degree distribution of random intersection graphs , 2004 .

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

[27]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[28]  Mindaugas Bloznelis,et al.  Degree Distribution of an Inhomogeneous Random Intersection Graph , 2012, Electron. J. Comb..