{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:12:32Z","timestamp":1747887152987,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031928970","type":"print"},{"value":"9783031928987","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92898-7_5","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T13:13:40Z","timestamp":1747833220000},"page":"65-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Connectivity Threshold for\u00a0Superpositions of\u00a0Bernoulli Random Graphs"],"prefix":"10.1007","author":[{"given":"Daumilas","family":"Ardickas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mindaugas","family":"Bloznelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rimantas","family":"Vaicekauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ardickas, D., Bloznelis, M.: Connectivity threshold for superpositions of Bernoulli random graphs. arxiv:2306.08113v2 (2023)","DOI":"10.1002\/rsa.21140"},{"issue":"15","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2024.05.045","volume":"357","author":"E Bergman","year":"2024","unstructured":"Bergman, E., Leskel\u00e4, L.: Connectivity of random hypergraphs with a given hyperedge size distribution. Discret. Appl. Math. 357(15), 1\u201313 (2024)","journal-title":"Discret. Appl. Math."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1017\/jpr.2023.48","volume":"61","author":"M Bloznelis","year":"2024","unstructured":"Bloznelis, M., Karjalainen, J., Leskel\u00e4, L.: Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. J. Appl. Probab. 61, 401\u2013419 (2024)","journal-title":"J. Appl. Probab."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/rsa.21140","volume":"63","author":"M Bloznelis","year":"2023","unstructured":"Bloznelis, M., Leskel\u00e4, L.: Clustering and percolation on superpositions of Bernoulli random graphs. Random Struct. Algorithms 63(2), 283\u2013342 (2023)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bloznelis, M., Marma, D., Vaicekauskas, R.: Connectivity threshold for superpositions of Bernoulli random graphs. II. arXiv:2311.09317 (2023)","DOI":"10.1002\/rsa.21140"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"I. Publ. Math. Debrecen"},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2015","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2015)"},{"key":"5_CR8","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.: Random intersection graphs and classification. In: Decker, R., Lenz, H.J. (eds.) Advances in Data Analysis, pp. 67\u201374. Springer, Heidelberg (2007)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00f6hn, T., Karjalainen, J., Leskel\u00e4, L.: Clique and cycle frequencies in a sparse random graph model with overlapping communities. Stohastic models (2024)","DOI":"10.1080\/15326349.2024.2313987"},{"key":"5_CR10","unstructured":"van der Hofstad, R.: Random Graphs and Complex Networks. Cambridge Series in Statistical and Probabilistic Mathematics, vol. 1. Cambridge University Press, Cambridge (2017)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1017\/apr.2021.12","volume":"53","author":"R van der Hofstad","year":"2021","unstructured":"van der Hofstad, R., Komj\u00e1thy, J., Vadon, V.: Random intersection graphs with communities. Adv. Appl. Probab. 53, 1061\u20131089 (2021)","journal-title":"Adv. Appl. Probab."},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1002\/rsa.21081","volume":"61","author":"S Petti","year":"2022","unstructured":"Petti, S., Vempala, S.S.: Approximating sparse graphs: the random overlapping communities model. Random Struct. Algorithms 61, 844\u2013908 (2022)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Community-affiliation graph model for overlapping network community detection. In: IEEE 12th International Conference on Data Mining, pp. 1170\u20131175. IEEE (2012)","DOI":"10.1109\/ICDM.2012.139"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594454","volume":"5","author":"J Yang","year":"2014","unstructured":"Yang, J., Leskovec, J.: Structure and overlaps of ground-truth communities in networks. ACM Trans. Intell. Syst. Technol. 5(2), 1\u201335 (2014)","journal-title":"ACM Trans. Intell. Syst. Technol."}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92898-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T13:13:46Z","timestamp":1747833226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92898-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031928970","9783031928987"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92898-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors\u00a0have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Modelling and Mining Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}