{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:44Z","timestamp":1740098924355,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319678092"},{"type":"electronic","value":"9783319678108"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67810-8_1","type":"book-chapter","created":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T01:42:34Z","timestamp":1504575754000},"page":"1-15","source":"Crossref","is-referenced-by-count":7,"title":["Moment-Based Parameter Estimation in Binomial Random Intersection Graph Models"],"prefix":"10.1007","author":[{"given":"Joona","family":"Karjalainen","sequence":"first","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":[[2017,9,6]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1214\/13-AAP942","volume":"24","author":"FG Ball","year":"2014","unstructured":"Ball, F.G., Sirl, D.J., Trapman, P.: Epidemics on random intersection graphs. Ann. Appl. Probab. 24(3), 1081\u20131128 (2014). http:\/\/dx.doi.org\/10.1214\/13-AAP942","journal-title":"Ann. Appl. Probab."},{"issue":"5","key":"1_CR2","doi-asserted-by":"crossref","first-page":"2280","DOI":"10.1214\/11-AOS904","volume":"39","author":"PJ Bickel","year":"2011","unstructured":"Bickel, P.J., Chen, A., Levina, E.: The method of moments and degree distributions for network models. Ann. Statist. 39(5), 2280\u20132301 (2011). http:\/\/dx.doi.org\/10.1214\/11-AOS904","journal-title":"Ann. Statist."},{"issue":"1","key":"1_CR3","doi-asserted-by":"crossref","first-page":"R110","DOI":"10.37236\/382","volume":"17","author":"M Bloznelis","year":"2010","unstructured":"Bloznelis, M.: The largest component in an inhomogeneous random intersection graph with clustering. Electron. J. Combin. 17(1), R110 (2010)","journal-title":"Electron. J. Combin."},{"issue":"3","key":"1_CR4","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1214\/12-AAP874","journal-title":"Ann. Appl. Probab."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comnet\/cnv010","volume":"4","author":"M Bloznelis","year":"2015","unstructured":"Bloznelis, M., Kurauskas, V.: Clustering function: another view on clustering coefficient. J. Complex Netw. 4, 61\u201386 (2015)","journal-title":"J. Complex Netw."},{"key":"1_CR6","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). doi: 10.1007\/978-3-319-49787-7_3"},{"issue":"3","key":"1_CR7","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1017\/S002190020000468X","volume":"45","author":"T Britton","year":"2008","unstructured":"Britton, T., Deijfen, M., Lager\u00e5s, A.N., Lindholm, M.: Epidemics on random graphs with tunable clustering. J. Appl. Probab. 45(3), 743\u2013756 (2008). http:\/\/dx.doi.org\/10.1239\/jap\/1222441827","journal-title":"J. Appl. Probab."},{"issue":"4","key":"1_CR8","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1017\/S0269964809990064","journal-title":"Probab. Eng. Inform. Sc."},{"issue":"3","key":"1_CR9","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1080\/15427951.2012.680824","volume":"8","author":"DF Gleich","year":"2012","unstructured":"Gleich, D.F., Owen, A.B.: Moment-based estimation of stochastic Kronecker graph parameters. Internet Math. 8(3), 232\u2013256 (2012). http:\/\/projecteuclid.org\/euclid.im\/1345581012","journal-title":"Internet Math."},{"key":"1_CR10","doi-asserted-by":"crossref","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 Discr. Math. 10, 129\u2013132 (2001)","journal-title":"Electron. Notes Discr. Math."},{"key":"1_CR11","volume-title":"Concrete Mathematics","author":"RL Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1994)"},{"key":"1_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/9781316779422","volume-title":"Random Graphs and Complex Networks","author":"R Hofstad van der","year":"2017","unstructured":"van der Hofstad, R.: Random Graphs and Complex Networks. Cambridge University Press, Cambridge (2017)"},{"issue":"1\u20132","key":"1_CR13","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1017\/S0963548398003459","journal-title":"Combin. Probab. Comput."},{"key":"1_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88146-1","volume-title":"Statistical Analysis of Network Data","author":"ED Kolaczyk","year":"2009","unstructured":"Kolaczyk, E.D.: Statistical Analysis of Network Data. Springer, New York (2009)"},{"key":"1_CR15","unstructured":"Lager\u00e5s, A.N., Lindholm, M.: A note on the component structure in random intersection graphs with tunable clustering. Electron. J. Combin. 15(1), Note 10, 8 (2008). http:\/\/www.combinatorics.org\/Volume_15\/Abstracts\/v15i1n10.html"},{"issue":"2","key":"1_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003). http:\/\/dx.doi.org\/10.1137\/S003614450342480","journal-title":"SIAM Rev."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-642-32589-2_63","volume-title":"Mathematical Foundations of Computer Science 2012","author":"S Nikoletseas","year":"2012","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Maximum cliques in graphs with small intersection number and random intersection graphs. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 728\u2013739. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32589-2_63"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: algorithms and laws. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 608\u2013617, December 2008","DOI":"10.1109\/ICDM.2008.72"},{"key":"1_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"}],"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-67810-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T03:03:11Z","timestamp":1602903791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67810-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319678092","9783319678108"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67810-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}