{"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":1747834098560,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"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":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-44983-7_7","type":"book-chapter","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T15:06:40Z","timestamp":1430924800000},"page":"79-88","source":"Crossref","is-referenced-by-count":15,"title":["Recent Progress in Complex Network Analysis: Properties 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":"7_CR1","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1214\/13-AAP942","volume":"24","author":"F. Ball","year":"2014","unstructured":"Ball, F., Sirl, D., & Trapman, P. (2014). Epidemics on random intersection graphs. The Annals of Applied Probability, 24, 1081\u20131128.","journal-title":"The Annals of Applied Probability"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0963548309990253","volume":"18","author":"J. Balogh","year":"2009","unstructured":"Balogh, J., Bohman, T., & Mubayi, D. (2009). Erd\u0151s\u2013Ko\u2013Rado in random hypergraphs. Combinatorics, Probability and Computing, 18, 629\u2013646.","journal-title":"Combinatorics, Probability and Computing"},{"key":"7_CR3","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":"7_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s100510050067","volume":"13","author":"A. Barrat","year":"2000","unstructured":"Barrat, A., & Weigt, M. (2000). On the properties of small-world networks. The European Physical Journal B, 13, 547\u2013560.","journal-title":"The European Physical Journal B"},{"issue":"1","key":"7_CR5","doi-asserted-by":"crossref","first-page":"R17","DOI":"10.37236\/935","volume":"14","author":"M. Behrisch","year":"2007","unstructured":"Behrisch, M. (2007). Component evolution in random intersection graphs. The Electronic Journal of Combinatorics, 14(1), R17","journal-title":"The Electronic Journal of Combinatorics"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1137\/050647153","volume":"23","author":"M. Behrisch","year":"2009","unstructured":"Behrisch, M., Taraz, A., & Ueckerdt, M. (2009). Colouring random intersection graphs and complex networks. SIAM Journal on Discrete Mathematics, 23, 288\u2013299.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"7_CR7","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":"7_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-010-9481-x","volume":"64","author":"S. Blackburn","year":"2012","unstructured":"Blackburn, S., Stinson, D., & Upadhyay, J. (2012). On the complexity of the herding attack and some related attacks on hash functions. Designs, Codes and Cryptography, 64, 171\u2013193.","journal-title":"Designs, Codes and Cryptography"},{"key":"7_CR9","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":"7_CR10","unstructured":"Bloznelis, M. (2009). Loglog distances in a power law random intersection graphs. Preprint 09059, CRC701. http:\/\/www.math.uni-bielefeld.de\/sfb701."},{"key":"7_CR11","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":"7_CR12","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":"7_CR13","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":"7_CR14","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":"7_CR15","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":"7_CR16","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\u2014Models of random intersection graphs. In B. Lausen, S. Krolak-Schwerdt, & M. Boehmer (Eds.), European Conference on Data Analysis. Berlin\/Heidelberg\/New York: Springer (in this volume)."},{"key":"7_CR17","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":"7_CR18","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":"7_CR19","doi-asserted-by":"crossref","unstructured":"Bloznelis, M., & Karo\u0144ski, M. (2013). Random intersection graph process. In A. Bonato, M. Mitzenmacher, & P. Pralat (Eds.), 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":"7_CR20","unstructured":"Bloznelis, M., & Kurauskas, V. (2012). Clustering function: A measure of social influence. http:\/\/arxiv.org\/abs\/1207.4941."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Bloznelis, M., & Kurauskas, V. (2013). Large cliques in sparse random intersection graphs. arXiv:1302.4627 [math.CO].","DOI":"10.1214\/EJP.v18-2277"},{"key":"7_CR22","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"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10986-011-9115-7","volume":"51","author":"M. Bloznelis","year":"2011","unstructured":"Bloznelis, M., & Radavi\u010dius, I. (2011). A note on Hamiltonicity of uniform random intersection graphs. Lithuanian Mathematical Journal, 51(2), 155\u2013161.","journal-title":"Lithuanian Mathematical Journal"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Bradonjic, M., Hagberg, A., Hengartner, N. W., & Percus, A. G. (2010). Component evolution in general random intersection graphs. In R. Kumar & D. Sivakumar (Eds.), WAW 2010. Lecture notes in computer science (Vol. 6516, pp. 36\u201349). Berlin\/Heidelberg: Springer.","DOI":"10.1007\/978-3-642-18009-5_5"},{"key":"7_CR25","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":"7_CR26","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":"7_CR27","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":"7_CR28","doi-asserted-by":"crossref","unstructured":"Foudalis, I., Jain, K., Papadimitriou, C., & Sideri, M. (2011). Modeling social networks through user background and behavior. In A. Frieze, P. Horn, & P. Pralat (Eds.), WAW 2011. Lecture notes in computer science (Vol. 6732, pp. 85\u2013102). Berlin\/Heidelberg: Springer.","DOI":"10.1007\/978-3-642-21286-4_8"},{"key":"7_CR29","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":"7_CR30","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. Geyer-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":"7_CR31","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1257\/aer.97.3.890","volume":"97","author":"O. M. Jackson","year":"2007","unstructured":"Jackson, O. M., & Rogers, B. W. (2007). Meeting strangers and friends of friends: How random are social networks? American Economic Review, 97, 890\u2013915.","journal-title":"American Economic Review"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1239\/jap\/1294170524","volume":"47","author":"S. Janson","year":"2010","unstructured":"Janson, S., \u0141uczak, T., & Norros, I. (2010a). Large cliques in a power-law random graph. Journal of Applied Probability, 47, 1124\u20131135.","journal-title":"Journal of Applied Probability"},{"key":"7_CR33","volume-title":"Random graphs","author":"S. Janson","year":"2010","unstructured":"Janson, S., \u0141uczak, T., & Ruci\u0144ski, A. (2010b). Random graphs. New York: Wiley."},{"key":"7_CR34","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":"7_CR35","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"},{"key":"7_CR36","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":"7_CR37","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1016\/j.disc.2012.12.024","volume":"313","author":"V. Kurauskas","year":"2013","unstructured":"Kurauskas, V. (2013). On small subgraphs in a random intersection digraph. Discrete Mathematics, 313, 872\u2013885.","journal-title":"Discrete Mathematics"},{"key":"7_CR38","unstructured":"Kurauskas, V., & Rybarczyk, K. (2013). On the chromatic index of random uniform hypergraphs SIAM Journal on Discrete Mathematics. To appear."},{"issue":"1","key":"7_CR39","doi-asserted-by":"crossref","first-page":"N10","DOI":"10.37236\/885","volume":"15","author":"A. N. Lager\u00e5s","year":"2008","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), N10.","journal-title":"Electronic Journal of Combinatorics"},{"key":"7_CR40","doi-asserted-by":"publisher","first-page":"026121","DOI":"10.1103\/PhysRevE.68.026121","volume":"68","author":"M. E. J. Newman","year":"2003","unstructured":"Newman, M. E. J. (2003). Properties of highly clustered networks. Physical Review E, 68, 026121.","journal-title":"Physical Review E"},{"key":"7_CR41","doi-asserted-by":"publisher","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"M. E. J. Newman","year":"2001","unstructured":"Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64, 026118.","journal-title":"Physical Review E"},{"key":"7_CR42","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":"7_CR43","doi-asserted-by":"crossref","unstructured":"Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2012). Maximum cliques in graphs with small intersection number and random intersection graphs. In Mathematical foundations of computer science (pp.728\u2013739). Berlin\/Heidelberg: Springer.","DOI":"10.1007\/978-3-642-32589-2_63"},{"key":"7_CR44","doi-asserted-by":"publisher","first-page":"026112","DOI":"10.1103\/PhysRevE.67.026112","volume":"67","author":"E. Ravasz","year":"2003","unstructured":"Ravasz, E., & Barab\u00e1si, A. L. (2003). Hierarchical organization in complex networks. Physical Review E, 67, 026112.","journal-title":"Physical Review E"},{"key":"7_CR45","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"},{"issue":"1","key":"7_CR46","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":"7_CR47","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. Geyer-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":"7_CR48","unstructured":"Rybarczyk, K. (2013). The coupling method for inhomogeneous random intersection graphs. arXiv:1301.0466."},{"key":"7_CR49","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2014.01.006","volume":"524","author":"K. Rybarczyk","year":"2014","unstructured":"Rybarczyk, K. (2014). Constructions of independent sets in random intersection graphs. Theoretical Computer Science, 524, 103\u2013125.","journal-title":"Theoretical Computer Science"},{"key":"7_CR50","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1239\/jap\/1285335412","volume":"47","author":"K. Rybarczyk","year":"2010","unstructured":"Rybarczyk, K., & Stark, D. (2010). Poisson approximation of the number of cliques in random intersection graphs. Journal of Applied Probability, 47, 826\u2013840.","journal-title":"Journal of Applied Probability"},{"key":"7_CR51","unstructured":"Singer, K. (1995). Random intersection graphs. Ph.D. thesis, The Johns Hopkins University."},{"key":"7_CR52","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":"7_CR53","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":"7_CR54","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1109\/TIT.2011.2181331","volume":"58","author":"O. Yagan","year":"2012","unstructured":"Yagan, O., & Makowski, A. M. (2012). Zero-one laws for connectivity in random key graphs, IEEE Transactions on Information Theory, 58, 2983\u20132999","journal-title":"IEEE Transactions on Information Theory"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T08:27:57Z","timestamp":1674203277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44983-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662449820","9783662449837"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44983-7_7","relation":{},"ISSN":["1431-8814","2198-3321"],"issn-type":[{"type":"print","value":"1431-8814"},{"type":"electronic","value":"2198-3321"}],"subject":[],"published":{"date-parts":[[2015]]}}}