{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:02:07Z","timestamp":1742922127643,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484774"},{"type":"electronic","value":"9783030484781"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48478-1_9","type":"book-chapter","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:57:21Z","timestamp":1591059441000},"page":"124-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Note on the Conductance of the Binomial Random Intersection Graph"],"prefix":"10.1007","author":[{"given":"Katarzyna","family":"Rybarczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mindaugas","family":"Bloznelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Jaworski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"key":"9_CR1","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-662-44983-7_7","volume-title":"Data Science, Learning by Latent Structures, and Knowledge Discovery","author":"M Bloznelis","year":"2015","unstructured":"Bloznelis, M., Godehardt, E., Jaworski, J., Kurauskas, V., Rybarczyk, K.: Recent progress in complex network analysis: properties of random intersection graphs. In: Lausen, B., Krolak-Schwerdt, S., B\u00f6hmer, M. (eds.) Data Science, Learning by Latent Structures, and Knowledge Discovery. SCDAKO, pp. 79\u201388. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44983-7_7"},{"key":"9_CR2","unstructured":"Bloznelis, M., Jaworski, J., Rybarczyk, K.: The cover time of a sparse random intersection graph. \narXiv:1910.09639\n\n (2019)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1239\/jap\/1222441827","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)","journal-title":"J. Appl. Probab."},{"key":"9_CR4","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. Engrg. Inform. Sci. 23, 661\u2013674 (2009)","journal-title":"Probab. Engrg. Inform. Sci."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Eschenauer, L, Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41\u201347 (2002)","DOI":"10.1145\/586110.586117"},{"key":"9_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2016","unstructured":"Frieze, A., Karonski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2016)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-6377(87)90003-4","volume":"6","author":"PW Glynn","year":"1987","unstructured":"Glynn, P.W.: Upper bounds for Poisson tail probabilities. Oper. Res. Lett. 6, 9\u201314 (1987)","journal-title":"Oper. Res. Lett."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-55721-7_8","volume-title":"Exploratory Data Analysis in Empirical Research. Studies in Classification, Data Analysis, and Knowledge Organization","author":"E Godehardt","year":"2003","unstructured":"Godehardt, E., Jaworski, J.: Two models of random intersection graphs for classification. In: Schwaiger, M., Opitz, O. (eds.) Exploratory Data Analysis in Empirical Research. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 67\u201381. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-642-55721-7_8"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Amer. Stat. Assoc."},{"key":"9_CR10","volume-title":"Random Graphs","author":"S Janson","year":"2001","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2001)"},{"key":"9_CR11","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. Comb. Probab. Comput. 8, 131\u2013159 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2002)","journal-title":"Phys. Rev. E"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-74456-6_6","volume-title":"Mathematical Foundations of Computer Science 2007","author":"SE Nikoletseas","year":"2007","unstructured":"Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: Expander properties and the cover time of random intersection graphs. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 44\u201355. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74456-6_6"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-75414-5_15","volume-title":"Algebraic Informatics","author":"S Nikoletseas","year":"2007","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: The second eigenvalue of random walks on symmetric random intersection graphs. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 236\u2013246. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75414-5_15"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Rybarczyk, K.: The coupling method for inhomogeneous random intersection graphs. Electron. J. Combin. 24(2) (2017). Paper 2.10","DOI":"10.37236\/5186"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82, 93\u2013133 (1989)","journal-title":"Inf. Comput."},{"key":"9_CR17","unstructured":"Singer-Cohen, K.B.: Random Intersection Graphs. Ph.D. thesis, The Johns Hopkins University, Department of Mathematical Sciences (1995)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-39212-2_5","volume-title":"Automata, Languages, and Programming","author":"PG Spirakis","year":"2013","unstructured":"Spirakis, P.G., Nikoletseas, S., Raptopoulos, C.: A guided tour in random intersection graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 29\u201335. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39212-2_5"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1080\/00029890.1994.11996904","volume":"101","author":"JM Steele","year":"1994","unstructured":"Steele, J.M.: Le Cam\u2019s inequality and Poisson approximations. Am. Math. Monthly 101, 48\u201354 (1994)","journal-title":"Am. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48478-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:59:11Z","timestamp":1591059551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48478-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484774","9783030484781"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48478-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.ryerson.ca\/waw2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was postponed from June 2020 to September 2020 due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}