Degree and clustering coefficient in sparse random intersection graphs

Annals of Applied Probability

Volumn 23, Issue 3, 2013, Pages 1254-1289

  Bloznelis, Mindaugas ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Clustering coefficient; Degree distribution; Power law; Random intersection graph

Indexed keywords

EID: 84879636377     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/12-AAP874     Document Type: Article

References (30)

1. BARBOUR, A. D. and REINERT, G. (2011). The shortest distance in random multi-type intersection graphs. Random Structures Algorithms 39 179-209. MR2850268
2. BARRAT, A. and WEIGT, M. (2000). On the properties of small-world networks. Eur. Phys. J. B 13 547-560.
3. BLACKBURN, S. R. and GERKE, S. (2009). Connectivity of the uniform random intersection graph. Discrete Math. 309 5130-5140. MR2548914
4. BLOZNELIS, M. (2008). Degree distribution of a typical vertex in a general random intersection graph. Lith. Math. J. 48 38-45. MR2398169
5. BLOZNELIS, M. (2010). A random intersection digraph: Indegree and outdegree distributions. Discrete Math. 310 2560-2566. MR2669380
6. BLOZNELIS, M. (2010). The largest component in an inhomogeneous random intersection graph with clustering. Electron. J. Combin. 17 Research Paper 110, 17. MR2679564
7. BREIMAN, L. (1968). Probability. Addison-Wesley, Reading, MA. MR0229267
8. BRITTON, T., DEIJFEN, M., LAGERÅS, A. N. and LINDHOLM, M. (2008). Epidemics on random graphs with tunable clustering. J. Appl. Probab. 45 743-756. MR2455182
9. DEIJFEN, M. and KETS, W. (2009). Random intersection graphs with tunable degree distribution and clustering. Probab. Engrg. Inform. Sci. 23 661-674. MR2535025
10. ESCHENAUER, L. and GLIGOR, V. D. (2002). A key-management scheme for distributed sensor networks. In Proceedings of the 9thACM Conference on Computer and Communications Security, Washington, DC 41-47.
11. FOSS, S., KORSHUNOV, D. and ZACHARY, S. (2011). An Introduction to Heavy-Tailed and Subexponential Distributions. ACM, New York. MR2810144
12. FOUDALIS, I., JAIN, K., PAPADIMITRIOU, C. and SIDERI, M. (2011). Modeling social networks through user background and behavior. In Algorithms and Models for the Web Graph. Lecture Notes in Computer Science 6732 85-102. Springer, Heidelberg. MR2842315
13. GODEHARDT, E. and JAWORSKI, J. (2001). Two models ofrandom intersection graphs and their applications. Electron. Notes Discrete Math. 10 129-132.
14. GODEHARDT, E. and JAWORSKI, J. (2003). Two models of random intersection graphs for classification. In Exploratory Data Analysis in Empirical Research 67-81. Springer, Berlin. MR2074223
15. GODEHARDT, E., JAWORSKI, J. and RYBARCZYK, K. (2012). Clustering coefficients ofrandom intersection graphs. In Studies in Classification, Data Analysis and Knowledge Organization 243-253. Springer, Berlin.
16. GUILLAUME, J.-L. and LATAPY, M. (2004). Bipartite structure of all complex networks. Inform. Process. Lett. 90 215-221. MR2054656
17. JAWORSKI, J., KAROŃSKI, M. and STARK, D. (2006). The degree of a typical vertex in generalized random intersection graph models. Discrete Math. 306 2152-2165. MR2255609
18. JAWORSKI, J. and STARK, D. (2008). The vertex degree distribution ofpassive random intersection graph models. Combin. Probab. Comput. 17 549-558. MR2433940
19. KAROŃSKI, M., SCHEINERMAN, E. R. and SINGER-COHEN, K. B. (1999). On random intersection graphs: The subgraph problem. Combin. Probab. Comput. 8 131-159. MR1684626
20. NEWMAN, M. E. J. (2003). Properties ofhighly clustered networks. Phys. Rev. E68 026121.
21. NEWMAN, M. E. J., STROGATZ, S. H. and WATTS, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64 026118.
22. NEWMAN, M. E. J., WATTS, D. J. and STROGATZ, S. H. (2002). Random graph models of social networks. Proc. Natl. Acad. Sci. USA 99 (Suppl. 1) 2566-2572.
23. NIKOLETSEAS, S., RAPTOPOULOS, C. and SPIRAKIS, P. G. (2011). On the independence number and Hamiltonicity of uniform random intersection graphs. Theoret. Comput. Sci. 412 6750-6760. MR2885093
24. RAVASZ, L. and BARABÁSI, A. L. (2003). Hierarchical organization in complex networks. Phys. Rev. E 67 026112.
25. RYBARCZYK, K. (2011). Diameter, connectivity, and phase transition of the uniform random intersection graph. Discrete Math. 311 1998-2019. MR2818878
26. RYBARCZYK, K. (2012). The degree distribution in random intersection graphs. In Challenges at the Interface of Data Analysis, Computer Science, and Optimization 291-299. Springer, Berlin.
27. STARK, D. (2004). The vertex degree distribution of random intersection graphs. Random Structures Algorithms 24 249-258. MR2068868
28. STEELE, J. M. (1994). Le Cam's inequality and Poisson approximations. Amer. Math. Monthly 101 48-54. MR1252705
29. WATTS, D. J. and STROGATZ, S. H. (1998). Collective dynamics of"small-world" networks. Nature 393 440-442.
30. YAGAN, O. and MAKOWSKI, A. M. (2009). Random key graphs\Can they be small worlds? In NETCOM'09: Proceedings of the 2009 First International Conference on Networks & Communications 313-318. IEEE Computer Society, Washington, DC