Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs
Experimental results show that in large complex networks such as Internet or biological networks, there is a tendency to connect elements which have a common neighbor. This tendency in theoretical random graph models is depicted by the asymptotically constant clustering coefficient. Moreover complex networks have power law degree distribution and small diameter (small world phenomena), thus these are desirable features of random graphs used for modeling real life networks. We survey various variants of random intersection graph models, which are important for networks modeling.
The work of M. Bloznelis and V. Kurauskas was supported by the Lithuanian Research Council (grant MIP–067/2013). J. Jaworski and K. Rybarczyk were supported by the National Science Centre—DEC-2011/01/B/ST1/03943. Co-operation between E. Godehardt and J. Jaworski was also supported by Deutsche Forschungsgemeinschaft (grant no. GO 490/17–1).
- Behrisch, M. (2007). Component evolution in random intersection graphs. The Electronic Journal of Combinatorics, 14(1).Google Scholar
- Bloznelis, M., Godehardt, E., Jaworski, J., Kurauskas, V., & Rybarczyk, K. (2015). Recent progress in complex network analysis: Properties of random intersection graphs. In B. Lausen, S. Krolak-Schwerdt, & M. Boehmer (Eds.), European Conference on Data Analysis. Berlin/Heidelberg/New York: Springer.Google Scholar
- Bloznelis, M., Jaworski, J., & Kurauskas, V. (2013). Assortativity and clustering of sparse random intersection graphs. Electronic Journal of Probability, 18, N-38.Google Scholar
- Bloznelis, M., & Karoński, M. (2013). Random intersection graph process. In A. Bonato, M. Mitzenmacher, & P. Pralat (Eds.), Algorithms and models for the web graph. WAW 2013. Lecture notes in computer science (Vol. 8305, pp. 93–105). Switzerland: Springer International Publishing.Google Scholar
- Bloznelis, M., & Kurauskas, V. (2012). Clustering function: A measure of social influence. http://www.arxiv.org/abs/1207.4941.
- Eschenauer, L., & Gligor, V. D. (2002). A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security (pp. 41–47).Google Scholar
- Fill, J. A., Scheinerman, E. R., & Singer-Cohen, K. B. (2000). Random intersection graphs when m = ω(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Structures and Algorithms, 16, 156–176.Google Scholar
- Godehardt, E., Jaworski, J., & Rybarczyk, K. (2012). Clustering coefficients of random intersection graphs. In W. Gaul, A. Geier-Schulz, L. Schmidt-Thieme, & J. Kunze (Eds.), Challenges at the interface of data analysis, computer science, and optimization (pp. 243–253). Berlin/Heidelberg/New York: Springer.CrossRefGoogle Scholar
- Lagerås, A. N., & Lindholm, M. (2008). A note on the component structure in random intersection graphs with tunable clustering. Electronic Journal of Combinatorics, 15(1).Google Scholar
- Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2004). The existence and efficient construction of large independent sets in general random intersection graphs. In J. Daz, J. Karhumki, A. Lepist, & D. Sannella (Eds.), ICALP. Lecture notes in computer science (Vol. 3142, pp. 1029–1040). Berlin: Springer.Google Scholar
- Rybarczyk, K. (2011b). Equivalence of the random intersection graph and G(n, p). Random Structures and Algorithms, 38, 205–234.Google Scholar
- Rybarczyk, K. (2013). The coupling method for inhomogeneous random intersection graphs. ArXiv:1301.0466.Google Scholar
- Shang, Y. (2010). Degree distributions in general random intersection graphs. The Electronical Journal of Combinatorics, 17, #R23.Google Scholar
- Yagan, O., & Makowski, A. M. (2009). Random key graphs – Can they be small worlds? In 2009 First International Conference on Networks & Communications (pp. 313–318).Google Scholar