{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T13:28:18Z","timestamp":1747834098944,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662449820"},{"type":"electronic","value":"9783662449837"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-44983-7_6","type":"book-chapter","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T15:06:40Z","timestamp":1430924800000},"page":"69-78","source":"Crossref","is-referenced-by-count":16,"title":["Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Mindaugas","family":"Bloznelis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erhard","family":"Godehardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Jaworski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentas","family":"Kurauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katarzyna","family":"Rybarczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/rsa.20351","volume":"39","author":"A. D. Barbour","year":"2011","unstructured":"Barbour, A. D., & Reinert, G. (2011). The shortest distance in random multi-type intersection graphs. Random Structures and Algorithms, 39, 179\u2013209.","journal-title":"Random Structures and Algorithms"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Behrisch, M. (2007). Component evolution in random intersection graphs. The Electronic Journal of Combinatorics, 14(1).","DOI":"10.37236\/935"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"5130","DOI":"10.1016\/j.disc.2009.03.042","volume":"309","author":"S. Blackburn","year":"2009","unstructured":"Blackburn, S., & Gerke, S. (2009). Connectivity of the uniform random intersection graph. Discrete Mathematics, 309, 5130\u20135140.","journal-title":"Discrete Mathematics"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s10986-008-0004-7","volume":"48","author":"M. Bloznelis","year":"2008","unstructured":"Bloznelis, M. (2008). Degree distribution of a typical vertex in a general random intersection graph. Lithuanian Mathematical Journal, 48, 38\u201345.","journal-title":"Lithuanian Mathematical Journal"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"2560","DOI":"10.1016\/j.disc.2010.06.018","volume":"310","author":"M. Bloznelis","year":"2010","unstructured":"Bloznelis, M. (2010a). A random intersection digraph: Indegree and outdegree distributions. Discrete Mathematics, 310, 2560\u20132566.","journal-title":"Discrete Mathematics"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/080713756","volume":"24","author":"M. Bloznelis","year":"2010","unstructured":"Bloznelis, M. (2010b). Component evolution in general random intersection graphs. SIAM Journal on Discrete Mathematics, 24, 639\u2013654.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"6_CR7","doi-asserted-by":"crossref","first-page":"R110","DOI":"10.37236\/382","volume":"17","author":"M. Bloznelis","year":"2010","unstructured":"Bloznelis, M. (2010c). The largest component in an inhomogeneous random intersection graph with clustering. The Electronic Journal of Combinatorics, 17(1), R110.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1214\/12-AAP874","volume":"23","author":"M. Bloznelis","year":"2013","unstructured":"Bloznelis, M. (2013). Degree and clustering coefficient in sparse random intersection graphs. The Annals of Applied Probability, 23, 1254\u20131289.","journal-title":"The Annals of Applied Probability"},{"issue":"3","key":"6_CR9","doi-asserted-by":"crossref","first-page":"R3","DOI":"10.37236\/2786","volume":"20","author":"M. Bloznelis","year":"2013","unstructured":"Bloznelis, M., & Damarackas, J. (2013). Degree distribution of an inhomogeneous random intersection graph. The Electronic Journal of Combinatorics, 20(3), R3.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"6_CR10","volume-title":"European Conference on Data Analysis","author":"M. Bloznelis","year":"2015","unstructured":"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."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Bloznelis, M., Jaworski, J., & Kurauskas, V. (2013). Assortativity and clustering of sparse random intersection graphs. Electronic Journal of Probability, 18, N-38.","DOI":"10.1214\/EJP.v18-2277"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.20256","volume":"53","author":"M. Bloznelis","year":"2009","unstructured":"Bloznelis, M., Jaworski, J., & Rybarczyk, K. (2009). Component evolution in a secure wireless sensor network. Networks, 53(1), 19\u201326.","journal-title":"Networks"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Bloznelis, M., & Karo\u0144ski, 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\u2013105). Switzerland: Springer International Publishing.","DOI":"10.1007\/978-3-319-03536-9_8"},{"key":"6_CR14","unstructured":"Bloznelis, M., & Kurauskas, V. (2012). Clustering function: A measure of social influence. http:\/\/www.arxiv.org\/abs\/1207.4941."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10474-012-0266-8","volume":"138","author":"M. Bloznelis","year":"2013","unstructured":"Bloznelis, M., & \u0141uczak, T. (2013). Perfect matchings in random intersection graphs. Acta Mathematica Hungarica, 138, 15\u201333.","journal-title":"Acta Mathematica Hungarica"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1239\/jap\/1222441827","volume":"45","author":"T. Britton","year":"2008","unstructured":"Britton, T., Deijfen, M., Lindholm, M., & Lager\u00e5s, N. A. (2008). Epidemics on random graphs with tunable clustering. Journal of Applied Probability, 45, 743\u2013756.","journal-title":"Journal of Applied Probability"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1017\/S0269964809990064","volume":"23","author":"M. Deijfen","year":"2009","unstructured":"Deijfen, M., & Kets, W. (2009). Random intersection graphs with tunable degree distribution and clustering. Probability in the Engineering and Informational Sciences, 23, 661\u2013674.","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"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\u201347).","DOI":"10.1145\/586110.586117"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Fill, J. A., Scheinerman, E. R., & Singer-Cohen, K. B. (2000). Random intersection graphs when m = \u03c9(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Structures and Algorithms, 16, 156\u2013176.","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-H"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S1571-0653(04)00377-4","volume":"10","author":"E. Godehardt","year":"2001","unstructured":"Godehardt, E., & Jaworski, J. (2001). Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics, 10, 129\u2013132.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-55721-7_8","volume-title":"Exploratory data analysis in empirical research","author":"E. Godehardt","year":"2003","unstructured":"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\u201381). Berlin\/Heidelberg\/New York: Springer."},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-70981-7_8","volume-title":"Advances in data analysis","author":"E. Godehardt","year":"2007","unstructured":"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\u201374). Berlin\/Heidelberg\/New York: Springer."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-24466-7_25","volume-title":"Challenges at the interface of data analysis, computer science, and optimization","author":"E. Godehardt","year":"2012","unstructured":"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\u2013253). Berlin\/Heidelberg\/New York: Springer."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ipl.2004.03.007","volume":"90","author":"J. L. Guillaume","year":"2004","unstructured":"Guillaume, J. L., & Latapy, M. (2004). Bipartite structure of all complex networks. Information Processing Letters, 90, 215\u2013221.","journal-title":"Information Processing Letters"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1016\/j.disc.2006.05.013","volume":"306","author":"J. Jaworski","year":"2006","unstructured":"Jaworski, J., Karo\u0144ski, M., & Stark, D. (2006). The degree of a typical vertex in generalized random intersection graph models. Discrete Mathematics, 306, 2152\u20132165.","journal-title":"Discrete Mathematics"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0963548308009103","volume":"17","author":"J. Jaworski","year":"2008","unstructured":"Jaworski, J., & Stark, D. (2008). The vertex degree distribution of passive random intersection graph models. Combinatorics, Probability and Computing, 17, 549\u2013558.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0963548312000429","volume":"22","author":"J. R. Johnson","year":"2013","unstructured":"Johnson, J. R., & Markstr\u00f6m, K. (2013). Tur\u00e1n and Ramsey properties of subcube intersection graphs. Combinatorics, Probability and Computing, 22(1), 55\u201370.","journal-title":"Combinatorics, Probability and Computing"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Scheinerman, E. R., & Singer-Cohen, K. B. (1999). On random intersection graphs: The subgraph problem. Combinatorics, Probability and Computing, 8, 131\u2013159.","journal-title":"Combinatorics, Probability and Computing"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Lager\u00e5s, A. N., & Lindholm, M. (2008). A note on the component structure in random intersection graphs with tunable clustering. Electronic Journal of Combinatorics, 15(1).","DOI":"10.37236\/885"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"012814","DOI":"10.1103\/PhysRevE.88.012814","volume":"88","author":"T. Martin","year":"2013","unstructured":"Martin, T., Ball, B., Karrer, B., & Newman, M. E. J. (2013). Coauthorship and citation patterns in the Physical Review. Phys. Rev. E 88, 012814.","journal-title":"Phys. Rev. E"},{"issue":"Suppl. 1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1073\/pnas.012582999","volume":"99","author":"M. E. J. Newman","year":"2002","unstructured":"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\u20132572.","journal-title":"Proceedings of the National Academy of Sciences of the USA"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"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\u20131040). Berlin: Springer.","DOI":"10.1007\/978-3-540-27836-8_86"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.tcs.2008.06.047","volume":"406","author":"S. Nikoletseas","year":"2008","unstructured":"Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2008). Large independent sets in general random intersection graphs. Theoretical Computer Science, 406, 215\u2013224.","journal-title":"Theoretical Computer Science"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"6750","DOI":"10.1016\/j.tcs.2011.09.003","volume":"412","author":"S. Nikoletseas","year":"2011","unstructured":"Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). On the independence number and Hamiltonicity of uniform random intersection graphs. Theoretical Computer Science, 412, 6750\u20136760.","journal-title":"Theoretical Computer Science"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1016\/j.disc.2011.05.029","volume":"311","author":"K. Rybarczyk","year":"2011","unstructured":"Rybarczyk, K. (2011a). Diameter, connectivity, and phase transition of the uniform random intersection graph. Discrete Mathematics, 311, 1998\u20132019.","journal-title":"Discrete Mathematics"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Rybarczyk, K. (2011b). Equivalence of the random intersection graph and G(n, p). Random Structures and Algorithms, 38, 205\u2013234.","DOI":"10.1002\/rsa.20356"},{"issue":"1","key":"6_CR37","doi-asserted-by":"crossref","first-page":"P36","DOI":"10.37236\/523","volume":"18","author":"K. Rybarczyk","year":"2011","unstructured":"Rybarczyk, K. (2011c). Sharp threshold functions for random intersection graphs via a coupling method. The Electronic Journal of Combinatorics, 18(1), P36.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-24466-7_30","volume-title":"Challenges at the interface of data analysis, computer science, and optimization","author":"K. Rybarczyk","year":"2012","unstructured":"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\u2013299). Berlin\/Heidelberg\/New York: Springer."},{"key":"6_CR39","first-page":"0466","volume":"1301","author":"K. Rybarczyk","year":"2013","unstructured":"Rybarczyk, K. (2013). The coupling method for inhomogeneous random intersection graphs. ArXiv:1301.0466.","journal-title":"ArXiv"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Shang, Y. (2010). Degree distributions in general random intersection graphs. The Electronical Journal of Combinatorics, 17, #R23.","DOI":"10.37236\/295"},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.20005","volume":"24","author":"D. Stark","year":"2004","unstructured":"Stark, D. (2004). The vertex degree distribution of random intersection graphs. Random Structures and Algorithms, 24, 249\u2013258.","journal-title":"Random Structures and Algorithms"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"S. H. Strogatz","year":"1998","unstructured":"Strogatz, S. H., & Watts, D. J. (1998). Collective dynamics of small-world networks. Nature, 393, 440\u2013442.","journal-title":"Nature"},{"key":"6_CR43","doi-asserted-by":"crossref","unstructured":"Yagan, O., & Makowski, A. M. (2009). Random key graphs \u2013 Can they be small worlds? In 2009 First International Conference on Networks & Communications (pp. 313\u2013318).","DOI":"10.1109\/NetCoM.2009.55"}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Data Science, Learning by Latent Structures, and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44983-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:44:54Z","timestamp":1676450694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44983-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662449820","9783662449837"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44983-7_6","relation":{},"ISSN":["1431-8814","2198-3321"],"issn-type":[{"type":"print","value":"1431-8814"},{"type":"electronic","value":"2198-3321"}],"subject":[],"published":{"date-parts":[[2015]]}}}