Assortativity and clustering of sparse random intersection graphs

Electronic Journal of Probability

Volumn 18, Issue , 2013, Pages 1-24

  Bloznelis, Mindaugas ^a   Jaworski, Jerzy ^b   Kurauskas, Valentas ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Assortativity; Clustering; Power law; Random graph; Random intersection graph

Indexed keywords

EID: 85037875911     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v18-2277     Document Type: Article

References (28)

1. Barbour, A. D. and Reinert, G.: The shortest distance in random multi-type intersection graphs, Random Structures and Algorithms 39 (2011), 179-209.
2. Barrat, A. and Weigt M.: On the properties of small-world networks, The European Physical Journal B 13 (2000), 547-560.
3. Behrisch, M.: Component evolution in random intersection graphs, The Electronical Journal of Combinatorics 14(1) (2007).
4. Blackburn, S. and Gerke, S.: Connectivity of the uniform random intersection graph, Discrete Mathematics 309 (2009), 5130-5140.
5. Bloznelis, M.: Degree distribution of a typical vertex in a general random intersection graph, Lithuanian Mathematical Journal 48 (2008), 38-45.
6. Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs, to appear in Annals of Applied Probability.
7. Britton, T., Deijfen, M., Lindholm, M. and Lageras, N. A.: Epidemics on random graphs with tunable clustering. Journal of Applied Probability 45 (2008), 743-756.
8. Deijfen, M. and Kets, W.:, Random intersection graphs with tunable degree distribution and clustering, Probab. Engrg. Inform. Sci. 23 (2009), 661-674.
9. Eschenauer, L. and Gligor, V. D.: A key-management scheme for distributed sensor networks, in: Proceedings of the 9th ACM Conference on Computer and Communications Security (2002), 41-47.
10. Godehardt, E. and Jaworski, J.: Two models of random intersection graphs and their applications, Electronic Notes in Discrete Mathematics 10 (2001), 129-132.
11. Godehardt, E. and Jaworski, J.: Two models of random intersection graphs for classification, in: Studies in Classification, Data Analysis and Knowledge Organization, Springer, Berlin-Heidelberg-New York, 2003, pp. 67-81.
12. Godehardt, E., Jaworski, J. and Rybarczyk, K.: Clustering coefficients of random intersection graphs, in: Studies in Classification, Data Analysis and Knowledge Organization, Springer, Berlin-Heidelberg-New York, 2012, 243-253.
13. Guillaume, J. L. and Latapy, M.: Bipartite structure of all complex networks, Inform. Process. Lett. 90 (2004), 215-221.
14. Jaworski, J. and Stark, D.: The vertex degree distribution of passive random intersection graph models, Combinatorics, Probability and Computing 17 (2008), 549-558.
15. Karonski, M., Scheinerman, E. R. and Singer-Cohen, K. B.: On random intersection graphs: The subgraph problem, Combinatorics, Probability and Computing 8 (1999), 131-159.
16. Lee, S. H., Kim, P. J. and Jeong, H.: Statistical properties of sampled networks, Physical Review E 73 (2006), 016102.
17. Newman, M. E. J., Strogatz, S. H. and Watts, D. J.: Random graphs with arbitrary degree distributions and their applications, Physical Review E 64 (2001), 026118.
18. Newman, M. E. J.: Assortative Mixing in Networks, Physical Review Letters 89 (2002), 208701.
19. Newman, M. E. J.: Mixing patterns in networks, Physical Review E 67 (2003), 026126.
20. Newman, M. E. J.: Properties of highly clustered networks, Physical Review E 68 (2003), 026121.
21. Newman, M. E. J. Watts, D. J. and Strogatz, S.H.: Random graph models of social networks, Proc. Natl. Acad. Sci. USA 99 (Suppl. 1) (2002), 2566-2572.
22. Nikoletseas, S., Raptopoulos, C. and Spirakis, P. G.: On the independence number and hamil-tonicity of uniform random intersection graphs, Theoretical Computer Science 412 (2011), 6750-6760.
23. Pastor-Satorras, R., Vazquez, A. and Vespignani, A.: Dynamical and correlation properties of the internet, Phys. Rev. Lett. 87 (2001), 258701.
24. Rybarczyk, K.: Diameter, connectivity, and phase transition of the uniform random intersection graph, Discrete Mathematics 311 (2011), 1998-2019.
25. Stark, D.: The vertex degree distribution of random intersection graphs, Random Structures Algorithms 24 (2004), 249-258.
26. Steele, J. M.: Le Cam's inequality and Poisson approximations, The American Mathematical Monthly 101 (1994), 48-54.
27. Strogatz, S. H. and Watts, D. J.: Collective dynamics of small-world networks, Nature 393 (1998), 440-442.
28. Yagan, O. and Makowski, A. M.: Zero-one laws for connectivity in random key graphs, IEEE Transactions on Information Theory 58 (2012), 2983-2999.