{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:37:00Z","timestamp":1740177420815,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["639.033.806"],"award-info":[{"award-number":["639.033.806"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["639.031.447"],"award-info":[{"award-number":["639.031.447"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["613.001.451"],"award-info":[{"award-number":["613.001.451"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s41109-019-0149-9","type":"journal-article","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T12:04:22Z","timestamp":1561637062000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new model for overlapping communities with arbitrary internal structure"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3759-5215","authenticated-orcid":false,"given":"Vikt\u00f3ria","family":"Vadon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00falia","family":"Komj\u00e1thy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Remco","family":"van der Hofstad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,27]]},"reference":[{"key":"149_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method. 3rd ed. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"N Alon","year":"2008","unstructured":"Alon, N, Spencer JH (2008) The Probabilistic Method. 3rd ed. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Hoboken. With an appendix on the life and work of Paul Erdo\u030bs. https:\/\/doi.org\/10.1002\/9780470277331 ."},{"key":"149_CR2","volume-title":"Branching Processes","author":"KB Athreya","year":"2004","unstructured":"Athreya, KB, Ney PE (2004) Branching Processes. Dover Publications, Inc., Mineola. Reprint of the 1972 original [Springer, New York; MR0373040]."},{"issue":"3","key":"149_CR3","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1239\/aap\/1253281063","volume":"41","author":"F Ball","year":"2009","unstructured":"Ball, F, Sirl D, Trapman P (2009) Threshold behaviour and final outcome of an epidemic on a random network with household structure. Adv Appl Probab 41(3):765\u2013796. https:\/\/doi.org\/10.1239\/aap\/1253281063 .","journal-title":"Adv Appl Probab"},{"issue":"2","key":"149_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.mbs.2009.12.003","volume":"224","author":"F Ball","year":"2010","unstructured":"Ball, F, Sirl D, Trapman P (2010) Analysis of a stochastic SIR epidemic on a random network incorporating household structure. Math Biosci 224(2):53\u201373. https:\/\/doi.org\/10.1016\/j.mbs.2009.12.003 .","journal-title":"Math Biosci"},{"key":"149_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1214\/EJP.v6-96","volume":"6","author":"I Benjamini","year":"2001","unstructured":"Benjamini, I, Schramm O (2001) Recurrence of distributional limits of finite planar graphs. Electron J Probab 6:23\u201313. https:\/\/doi.org\/10.1214\/EJP.v6-96 .","journal-title":"Electron J Probab"},{"issue":"2","key":"149_CR6","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/080713756","volume":"24","author":"M Bloznelis","year":"2010","unstructured":"Bloznelis, M (2010) Component evolution in general random intersection graphs. SIAM J Discrete Math 24(2):639\u2013654. https:\/\/doi.org\/10.1137\/080713756 .","journal-title":"SIAM J Discrete Math"},{"issue":"3","key":"149_CR7","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. Ann Appl Probab 23(3):1254\u20131289. https:\/\/doi.org\/10.1214\/12-AAP874 .","journal-title":"Ann Appl Probab"},{"key":"149_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-662-44983-7_7","volume-title":"Data Science, Learning by Latent Structures, and Knowledge Discovery. Stud. Classification Data Anal. Knowledge Organ.","author":"M Bloznelis","year":"2015","unstructured":"Bloznelis, M, Godehardt E, Jaworski J, Kurauskas V, Rybarczyk K (2015) Recent progress in complex network analysis: properties of random intersection graphs In: Data Science, Learning by Latent Structures, and Knowledge Discovery. Stud. Classification Data Anal. Knowledge Organ., 79\u201388.. Springer, Heidelberg."},{"issue":"4","key":"149_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur J Comb 1(4):311\u2013316.","journal-title":"Eur J Comb"},{"key":"149_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B (2001) Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511814068 ."},{"key":"149_CR11","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B, Riordan O (2003a) Robustness and vulnerability of scale-free random graphs. Internet Math 1(1):1\u201335.","DOI":"10.1080\/15427951.2004.10129080"},{"key":"149_CR12","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B, Riordan OM (2003b) Mathematical results on scale-free random graphs In: Handbook of Graphs and Networks, 1\u201334.. Wiley-VCH, Weinheim.","DOI":"10.1002\/3527602755.ch1"},{"key":"149_CR13","doi-asserted-by":"publisher","first-page":"058701","DOI":"10.1103\/PhysRevLett.90.058701","volume":"90","author":"R Cohen","year":"2003","unstructured":"Cohen, R, Havlin S (2003) Scale-free networks are ultrasmall. Phys Rev Lett 90:058701. https:\/\/doi.org\/10.1103\/PhysRevLett.90.058701 .","journal-title":"Phys Rev Lett"},{"key":"149_CR14","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen, R, Erez K, Ben-Avraham D, Havlin S (2000) Resilience of the internet to random breakdowns. Phys Rev Lett 85:4626\u20134628. https:\/\/doi.org\/10.1103\/PhysRevLett.85.4626 .","journal-title":"Phys Rev Lett"},{"issue":"4","key":"149_CR15","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. Probab Engrg Inform Sci 23(4):661\u2013674. https:\/\/doi.org\/10.1017\/S0269964809990064 .","journal-title":"Probab Engrg Inform Sci"},{"key":"149_CR16","doi-asserted-by":"publisher","first-page":"160202","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I Der\u00e9nyi","year":"2005","unstructured":"Der\u00e9nyi, I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94:160202. https:\/\/doi.org\/10.1103\/PhysRevLett.94.160202 .","journal-title":"Phys Rev Lett"},{"key":"149_CR17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdo\u030bs","year":"1959","unstructured":"Erdo\u030bs, P, R\u00e9nyi A (1959) On random graphs. I. Publ Math Debrecen 6:290\u2013297.","journal-title":"Publ Math Debrecen"},{"issue":"4","key":"149_CR18","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, EN (1959) Random graphs. Ann Math Stat 30(4):1141\u20131144.","journal-title":"Ann Math Stat"},{"key":"149_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55721-7_8","volume-title":"Two models of random intersection graphs for classification","year":"2003","unstructured":"Godehardt, E, Jaworski J (2003) Two models of random intersection graphs for classification(Schwaiger M, Opitz O, eds.). Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-55721-7_8 ."},{"issue":"5","key":"149_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ipl.2004.03.007","volume":"90","author":"J-L Guillaume","year":"2004","unstructured":"Guillaume, J-L, Latapy M (2004) Bipartite structure of all complex networks. Inform Process Lett 90(5):215\u2013221. https:\/\/doi.org\/10.1016\/j.ipl.2004.03.007 .","journal-title":"Inform Process Lett"},{"issue":"2","key":"149_CR21","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.physa.2006.04.047","volume":"371","author":"J-L Guillaume","year":"2006","unstructured":"Guillaume, J-L, Latapy M (2006) Bipartite graphs as models of complex networks. Phys A Stat Mech Appl 371(2):795\u2013813.","journal-title":"Phys A Stat Mech Appl"},{"key":"149_CR22","unstructured":"van der Hofstad, R, Komj\u00e1thy J, Vadon V (2018) Random intersection graphs with communities. arXiv:1809.02514."},{"key":"149_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/9781316779422","volume-title":"Random Graphs and Complex Networks. Vol. 1. Cambridge Series in Statistical and Probabilistic Mathematics, vol. 43","author":"R van der Hofstad","year":"2017","unstructured":"van der Hofstad, R (2017) Random Graphs and Complex Networks. Vol. 1. Cambridge Series in Statistical and Probabilistic Mathematics, vol. 43. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/9781316779422 ."},{"key":"149_CR24","unstructured":"van der Hofstad, R (2018+) Random Graphs and Complex Networks. Vol. 2. Available at http:\/\/www.win.tue.nl\/~rhofstad\/NotesRGCNII.pdf ."},{"key":"149_CR25","unstructured":"van der Hofstad, R, Komj\u00e1thy J, Vadon V (2019) Phase transition in random intersection graphs with communities. arXiv:1905.06253."},{"key":"149_CR26","doi-asserted-by":"publisher","unstructured":"van der Hofstad, R, van Leeuwaarden JSH, Stegehuis C (2016) Hierarchical configuration model. Internet Math. https:\/\/doi.org\/10.24166\/im.01.2017 .","DOI":"10.24166\/im.01.2017"},{"key":"149_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"S Janson","year":"2000","unstructured":"Janson, S, \u0141uczak T, Rucinski A (2000) Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York. https:\/\/doi.org\/10.1002\/9781118032718 ."},{"key":"149_CR28","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-92871-5_4","volume-title":"International Workshop on Algorithms and Models for the Web-Graph","author":"J Karjalainen","year":"2018","unstructured":"Karjalainen, J, Leeuwaarden JSHv, Leskel\u00e4 L (2018) Parameter estimators of sparse random intersection graphs with thinned communities In: International Workshop on Algorithms and Models for the Web-Graph, 44\u201358.. Springer, Cham."},{"issue":"1&2","key":"149_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M Karonski","year":"1999","unstructured":"Karonski, M, Scheinerman ER, Singer-Cohen KB (1999) On random intersection graphs: The subgraph problem. Comb Probab Comput 8(1&2):131\u2013159.","journal-title":"Comb Probab Comput"},{"key":"149_CR30","doi-asserted-by":"publisher","unstructured":"Molloy, M, Reed B (1995) A critical point for random graphs with a given degree sequence In: Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, \u201cRandom Graphs \u201993\u201d (Pozna\u0144, 1993), vol. 6, 161\u2013179. https:\/\/doi.org\/10.1002\/rsa.3240060204 .","DOI":"10.1002\/rsa.3240060204"},{"key":"149_CR31","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks","author":"MEJ Newman","year":"2010","unstructured":"Newman, MEJ (2010) Networks. Oxford University Press, Oxford. https:\/\/doi.org\/10.1093\/acprof:oso\/9780199206650.001.0001 ."},{"key":"149_CR32","doi-asserted-by":"crossref","unstructured":"Newman, ME (2003a) Properties of highly clustered networks. Phys Rev E 68(2):026121.","DOI":"10.1103\/PhysRevE.68.026121"},{"key":"149_CR33","doi-asserted-by":"crossref","unstructured":"Newman, ME (2003b) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256.","DOI":"10.1137\/S003614450342480"},{"issue":"5","key":"149_CR34","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"ME Newman","year":"2005","unstructured":"Newman, ME (2005) Power laws, Pareto distributions and Zipf\u2019s law. Contemp Phys 46(5):323\u2013351.","journal-title":"Contemp Phys"},{"issue":"17","key":"149_CR35","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 (2011) Diameter, connectivity, and phase transition of the uniform random intersection graph. Discret Math 311(17):1998\u20132019.","journal-title":"Discret Math"},{"key":"149_CR36","unstructured":"Singer, KB (1996) Random Intersection Graphs. ProQuest LLC, Ann Arbor. Thesis (Ph.D.)\u2013The Johns Hopkins University. http:\/\/gateway.proquest.com\/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi\/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:9617602 ."},{"issue":"1480","key":"149_CR37","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1098\/rspb.2001.1767","volume":"268","author":"RV Sol\u00e9","year":"2001","unstructured":"Sol\u00e9, RV, Montoya M (2001) Complexity and fragility in ecological networks. Proc R Soc London Ser B Biol Sci 268(1480):2039\u20132045.","journal-title":"Proc R Soc London Ser B Biol Sci"},{"key":"149_CR38","doi-asserted-by":"crossref","unstructured":"Stegehuis, C, van der Hofstad R, van Leeuwaerden JSH (2016a) Epidemic spreading on complex networks with community structures. Sci Rep 6. article number: 29748.","DOI":"10.1038\/srep29748"},{"key":"149_CR39","doi-asserted-by":"publisher","unstructured":"Stegehuis, C, van der Hofstad R, van Leeuwaerden JSH (2016b) Power-law relations in random networks with communities. Phys Rev E 94:012302. https:\/\/doi.org\/10.1103\/PhysRevE.94.012302 .","DOI":"10.1103\/PhysRevE.94.012302"},{"key":"149_CR40","doi-asserted-by":"publisher","first-page":"066130","DOI":"10.1103\/PhysRevE.65.066130","volume":"65","author":"A V\u00e1zquez","year":"2002","unstructured":"V\u00e1zquez, A, Pastor-Satorras R, Vespignani A (2002) Large-scale topological and dynamical properties of the internet. Phys Rev E 65:066130. https:\/\/doi.org\/10.1103\/PhysRevE.65.066130 .","journal-title":"Phys Rev E"},{"issue":"6684","key":"149_CR41","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440.","journal-title":"Nature"},{"issue":"8","key":"149_CR42","doi-asserted-by":"publisher","first-page":"4559","DOI":"10.1109\/TIT.2016.2574742","volume":"62","author":"O Ya\u011fan","year":"2016","unstructured":"Ya\u011fan, O (2016) Zero-one laws for connectivity in inhomogeneous random key graphs. IEEE Trans Inform Theory 62(8):4559\u20134574. https:\/\/doi.org\/10.1109\/TIT.2016.2574742 .","journal-title":"IEEE Trans Inform Theory"},{"issue":"5","key":"149_CR43","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1109\/TIT.2011.2181331","volume":"58","author":"O Yag\u030can","year":"2012","unstructured":"Yag\u030can, O, Makowski AM (2012) Zero-one laws for connectivity in random key graphs. IEEE Trans Inform Theory 58(5):2983\u20132999. https:\/\/doi.org\/10.1109\/TIT.2011.2181331 .","journal-title":"IEEE Trans Inform Theory"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0149-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-019-0149-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0149-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T20:21:18Z","timestamp":1694982078000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-019-0149-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,27]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s41109-019-0149-9","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2019,6,27]]},"assertion":[{"value":"12 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"42"}}