Recent progress in complex network analysis: Models of random intersection graphs

Studies in Classification, Data Analysis, and Knowledge Organization

Volumn 48, Issue , 2015, Pages 69-78

  Bloznelis, Mindaugas ^a   Godehardt, Erhard ^b   Jaworski, Jerzy ^c   Kurauskas, Valentas ^a   Rybarczyk, Katarzyna ^c  

^a VILNIUS UNIVERSITY   (Lithuania)

^b HEINRICH HEINE UNIVERSITY   (Germany)

^c ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

BIOLOGICAL NETWORKS; CLUSTERING COEFFICIENT; COMPLEX NETWORK ANALYSIS; DESIRABLE FEATURES; NETWORK ANALYSIS MODELS; POWER LAW DEGREE DISTRIBUTION; RANDOM GRAPH MODELS; RANDOM INTERSECTION GRAPHS; RECENT PROGRESS; SMALL WORLD PHENOMENON;

COMPLEX NETWORKS;

EID: 84945551933     PISSN: 14318814     EISSN: 21983321     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-662-44983-7_6     Document Type: Conference Paper

References (43)

1. Barbour, A. D., & Reinert, G. (2011). The shortest distance in random multi-type intersection graphs. Random Structures and Algorithms, 39, 179–209.
2. Behrisch, M. (2007). Component evolution in random intersection graphs. The Electronic Journal of Combinatorics, 14(1).
3. Blackburn, S., & Gerke, S. (2009). Connectivity of the uniform random intersection graph. Discrete Mathematics, 309, 5130–5140.
4. Bloznelis, M. (2008). Degree distribution of a typical vertex in a general random intersection graph. Lithuanian Mathematical Journal, 48, 38–45.
5. Bloznelis, M. (2010a). A random intersection digraph: Indegree and outdegree distributions. Discrete Mathematics, 310, 2560–2566.
6. Bloznelis, M. (2010b). Component evolution in general random intersection graphs. SIAM Journal on Discrete Mathematics, 24, 639–654.
7. Bloznelis, M. (2010c). The largest component in an inhomogeneous random intersection graph with clustering. The Electronic Journal of Combinatorics, 17(1), R110.
8. Bloznelis, M. (2013). Degree and clustering coefficient in sparse random intersection graphs. The Annals of Applied Probability, 23, 1254–1289.
9. Bloznelis, M., & Damarackas, J. (2013). Degree distribution of an inhomogeneous random intersection graph. The Electronic Journal of Combinatorics, 20(3), R3.
10. 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.
11. Bloznelis, M., Jaworski, J., & Kurauskas, V. (2013). Assortativity and clustering of sparse random intersection graphs. Electronic Journal of Probability, 18, N-38.
12. Bloznelis, M., Jaworski, J., & Rybarczyk, K. (2009). Component evolution in a secure wireless sensor network. Networks, 53(1), 19–26.
13. Bloznelis, M., & Karonski, 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.
14. Bloznelis, M., & Kurauskas, V, (2012). Clustering function: A measure of social influence. http://www.arxiv.org/abs/1207.4941.
15. Bloznelis, M., & Łuczak, T. (2013). Perfect matchings in random intersection graphs. Acta Mathematica Hungarica, 138, 15–33.
16. Britton, T., Deijfen, M., Lindholm, M., & Lagerås, N. A. (2008). Epidemics on random graphs with tunable clustering. Journal of Applied Probability, 45, 743–756.
17. Deijfen, M., & Kets, W. (2009). Random intersection graphs with tunable degree distribution and clustering. Probability in the Engineering and Informational Sciences, 23, 661–674.
18. 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).
19. Fill, J. A., Scheinerman, E. R., & Singer-Cohen, K. B. (2000). Random intersection graphs when m = w(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.
20. Godehardt, E., & Jaworski, J. (2001). Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics, 10, 129–132.
21. Godehardt, E., & Jaworski, J. (2003). Two models of random intersection graphs for classification. In M. Schwaiger & O. Opitz (Eds.), Exploratory data analysis in empirical research (pp. 67–81). Berlin/Heidelberg/New York: Springer
22. Godehardt, E., Jaworski, J., & Rybarczyk, K. (2007). Random intersection graphs and classification. In R. Decker & H.-J. Lenz (Eds.), Advances in data analysis (pp. 67–74). Berlin/Heidelberg/New York: Springer.
23. 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.
24. Guillaume, J. L., & Latapy, M. (2004). Bipartite structure of all complex networks. Information Processing Letters, 90, 215–221.
25. Jaworski, J., Karonski, M., & Stark, D. (2006). The degree of a typical vertex in generalized random intersection graph models. Discrete Mathematics, 306, 2152–2165.
26. Jaworski, J., & Stark, D. (2008). The vertex degree distribution of passive random intersection graph models. Combinatorics, Probability and Computing, 17, 549–558.
27. Johnson, J. R., & Markström, K. (2013). Turán and Ramsey properties of subcube intersection graphs. Combinatorics, Probablity and Computing, 22(1), 55–70.
28. Karoǹski, M., Scheinerman, E. R., & Singer-Cohen, K. B. (1999). On random intersection graphs: The subgraph problem. Combinatorics, Probability and Computing, 8, 131–159.
29. 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).
30. Martin, T., Ball, B., Karrer, B., & Newman, M. E. J. (2013). Coauthorship and citation patterns in the Physical Review. Phys. Rev. E 88, 012814.
31. Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002). Random graph models of social networks. Proceedings of the National Academy of Sciences of the USA, 99(Suppl. 1), 2566–2572.
32. 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.
33. Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2008). Large independent sets in general random intersection graphs. Theoretical Computer Science, 406, 215–224.
34. Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). On the independence number and Hamiltonicity of uniform random intersection graphs. Theoretical Computer Science, 412, 6750–6760.
35. Rybarczyk, K. (2011a). Diameter, connectivity, and phase transition of the uniform random intersection graph. Discrete Mathematics, 311, 1998–2019.
36. Rybarczyk, K. (2011b). Equivalence of the random intersection graph and G(n, p). Random Structures and Algorithms, 38, 205–234.
37. Rybarczyk, K. (2011c). Sharp threshold functions for random intersection graphs via a coupling method. The Electronic Journal of Combinatorics, 18(1), P36.
38. Rybarczyk, K. (2012). The degree distribution in 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. 291–299). Berlin/Heidelberg/New York: Springer.
39. Rybarczyk, K. (2013). The coupling method for inhomogeneous random intersection graphs. ArXiv:1301.0466.
40. Shang, Y. (2010). Degree distributions in general random intersection graphs. The Electronical Journal of Combinatorics, 17, #R23.
41. Stark, D. (2004). The vertex degree distribution of random intersection graphs. Random Structures and Algorithms, 24, 249–258.
42. Strogatz, S. H., & Watts, D. J. (1998). Collective dynamics of small-world networks. Nature, 393, 440–442.
43. 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).