{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:44:48Z","timestamp":1725979488683},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319928708"},{"type":"electronic","value":"9783319928715"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92871-5_4","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:51:15Z","timestamp":1527587475000},"page":"44-58","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities"],"prefix":"10.1007","author":[{"given":"Joona","family":"Karjalainen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan S. H.","family":"van Leeuwaarden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lasse","family":"Leskel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s00285-012-0609-7","volume":"66","author":"F Ball","year":"2013","unstructured":"Ball, F., Britton, T., Sirl, D.: A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon. J. Math. Biol. 66(4), 979\u20131019 (2013)","journal-title":"J. Math. Biol."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1239\/aap\/1418396240","volume":"46","author":"E Coupechoux","year":"2014","unstructured":"Coupechoux, E., Lelarge, M.: How clustering affects epidemics in random networks. Adv. Appl. Probab. 46(4), 985\u20131008 (2014)","journal-title":"Adv. Appl. Probab."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"29748","DOI":"10.1038\/srep29748","volume":"6","author":"C Stegehuis","year":"2016","unstructured":"Stegehuis, C., van der Hofstad, R., van Leeuwaarden, J.S.H.: Epidemic spreading on complex networks with community structures. Sci. Rep. 6, 29748 (2016)","journal-title":"Sci. Rep."},{"key":"4_CR4","unstructured":"van der Hofstad, R., van Leeuwaarden, J.S.H., Stegehuis, C.: Hierarchical configuration model. \narXiv:1512.08397\n\n (2015)"},{"issue":"1\u20132","key":"4_CR5","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.: On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8(1\u20132), 131\u2013159 (1999)","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1017\/S0269964809990064","volume":"23","author":"M Deijfen","year":"2009","unstructured":"Deijfen, M., Kets, W.: Random intersection graphs with tunable degree distribution and clustering. Probab. Eng. Inform. Sc. 23(4), 661\u2013674 (2009)","journal-title":"Probab. Eng. Inform. Sc."},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1214\/12-AAP874","volume":"23","author":"M Bloznelis","year":"2013","unstructured":"Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Probab. 23(3), 1254\u20131289 (2013)","journal-title":"Ann. Appl. Probab."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-319-49787-7_3","volume-title":"Algorithms and Models for the Web Graph","author":"M Bloznelis","year":"2016","unstructured":"Bloznelis, M., Leskel\u00e4, L.: Diclique clustering in a directed random graph. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2016. LNCS, vol. 10088, pp. 22\u201333. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49787-7_3"},{"key":"4_CR9","unstructured":"Petti, S., Vempala, S.: Random overlapping communities: Approximating motif densities of large graphs. \narXiv:1709.09477\n\n (2017)"},{"key":"4_CR10","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.: Hierarchical organization in complex networks. Phys. Rev. E 67, 026112 (2003)","journal-title":"Phys. Rev. E"},{"issue":"6295","key":"4_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Pachocki, J., Mitzenmacher, M.: Scalable motif-aware graph clustering. In: Proceedings of the 26th International Conference on World Wide Web, WWW 2017, pp. 1451\u20131460. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva (2017)","DOI":"10.1145\/3038912.3052653"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1111\/j.1749-6632.1979.tb32791.x","volume":"319","author":"O Frank","year":"1979","unstructured":"Frank, O.: Moment properties of subgraph counts in stochastic graphs. Ann. N. Y. Acad. Sci. 319(1), 207\u2013218 (1979)","journal-title":"Ann. N. Y. Acad. Sci."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.2007.0137","volume":"15","author":"F Picard","year":"2008","unstructured":"Picard, F., Daudin, J.J., Koskas, M., Schbath, S., Robin, S.: Assessing the exceptionality of network motifs. J. Comput. Biol. 15(1), 1\u201320 (2008)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"4_CR15","first-page":"31","volume":"4","author":"C Matias","year":"2006","unstructured":"Matias, C., Schbath, S., Birmel\u00e9, E., Daudin, J.J., Robin, S.: Network motifs: mean and variance for the count. Revstat 4(1), 31\u201351 (2006)","journal-title":"Revstat"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"022807","DOI":"10.1103\/PhysRevE.89.022807","volume":"89","author":"M Ostilli","year":"2014","unstructured":"Ostilli, M.: Fluctuation analysis in complex networks modeled by hidden-variable models: necessity of a large cutoff in hidden-variable models. Phys. Rev. E 89, 022807 (2014)","journal-title":"Phys. Rev. E"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-67810-8_1","volume-title":"Algorithms and Models for the Web Graph","author":"J Karjalainen","year":"2017","unstructured":"Karjalainen, J., Leskel\u00e4, L.: Moment-Based Parameter Estimation in Binomial Random Intersection Graph Models. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2017. LNCS, vol. 10519, pp. 1\u201315. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67810-8_1"},{"key":"4_CR18","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.: Two models of random intersection graphs and their applications. Electron. Notes Discrete Math. 10, 129\u2013132 (2001)","journal-title":"Electron. Notes Discrete Math."},{"key":"4_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2016","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2016)"},{"key":"4_CR20","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-24466-7_25","volume-title":"Proceedings of the 34th Annual Conference of the Gesellschaft f\u00fcr Klassifikation","author":"E Godehardt","year":"2012","unstructured":"Godehardt, E., Jaworski, J., Rybarczyk, K.: Clustering coefficients of random intersection graphs. In: Gaul, W.A., Geyer-Schulz, A., Schmidt-Thieme, L., Kunze, J. (eds.) Proceedings of the 34th Annual Conference of the Gesellschaft f\u00fcr Klassifikation. STUDIES CLASS, pp. 243\u2013253. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24466-7_25"},{"key":"4_CR21","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. \nhttp:\/\/snap.stanford.edu\/data"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350. ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"4_CR23","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92871-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:52:02Z","timestamp":1527587522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92871-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319928708","9783319928715"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92871-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}