{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:02:45Z","timestamp":1764784965836,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:00:00Z","timestamp":1662163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:00:00Z","timestamp":1662163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010666","name":"H2020 Research Infrastructures","doi-asserted-by":"publisher","award":["824115"],"award-info":[{"award-number":["824115"]}],"id":[{"id":"10.13039\/100010666","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13278-022-00963-z","type":"journal-article","created":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T17:02:31Z","timestamp":1662224551000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast generation of simple directed social network graphs with reciprocal edges and high clustering"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6422-7437","authenticated-orcid":false,"given":"Christoph","family":"Schweimer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,3]]},"reference":[{"key":"963_CR1","doi-asserted-by":"publisher","unstructured":"Ahn YY, Han S, Kwak H, et\u00a0al (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on world wide web. https:\/\/doi.org\/10.1145\/1242572.1242685","DOI":"10.1145\/1242572.1242685"},{"issue":"405","key":"963_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-405","volume":"10","author":"S Bansal","year":"2009","unstructured":"Bansal S, Khandelwal S, Meyers LA (2009) Exploring biological network structure with clustered random networks. BMC Bioinf 10(405):1\u201315. https:\/\/doi.org\/10.1186\/1471-2105-10-405","journal-title":"BMC Bioinf"},{"issue":"5439","key":"963_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"issue":"3","key":"963_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","volume":"24","author":"EA Bender","year":"1978","unstructured":"Bender EA, Canfield E (1978) The asymptotic number of labeled graphs with given degree sequences. J Comb Theory Ser A 24(3):296\u2013307. https:\/\/doi.org\/10.1016\/0097-3165(78)90059-6","journal-title":"J Comb Theory Ser A"},{"issue":"4","key":"963_CR5","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. https:\/\/doi.org\/10.1016\/S0195-6698(80)80030-8","journal-title":"Eur J Comb"},{"issue":"2","key":"963_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379445","volume":"53","author":"A Bonifati","year":"2020","unstructured":"Bonifati A, Holubov\u00e1 I, Prat-P\u00e9rez A et al (2020) Graph generators: state of the art and open challenges. ACM Comput Surv 53(2):1. https:\/\/doi.org\/10.1145\/3379445","journal-title":"ACM Comput Surv"},{"key":"963_CR7","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1007\/s10955-006-9168-x","volume":"124","author":"T Britton","year":"2006","unstructured":"Britton T, Deijfen M, Martin-L\u00f6f A (2006) Generating simple random graphs with prescribed degree distribution. J Stat Phys 124:1377\u20131397. https:\/\/doi.org\/10.1007\/s10955-006-9168-x","journal-title":"J Stat Phys"},{"issue":"1","key":"963_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1214\/12-SSY076","volume":"3","author":"N Chen","year":"2013","unstructured":"Chen N, Olvera-Cravioto M (2013) Directed random graphs with given degree distributions. Stoch Syst 3(1):147\u2013186. https:\/\/doi.org\/10.1214\/12-SSY076","journal-title":"Stoch Syst"},{"key":"963_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung F, Lu L (2002) Connected components in random graphs with given expected degree sequences. Ann Comb 6:125\u2013145. https:\/\/doi.org\/10.1007\/PL00012580","journal-title":"Ann Comb"},{"key":"963_CR10","doi-asserted-by":"publisher","unstructured":"Durak N, Kolda TG, Pinar A, et\u00a0al (2013) A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal. In: Proceedings of IEEE network science workshop. https:\/\/doi.org\/10.1109\/NSW.2013.6609190","DOI":"10.1109\/NSW.2013.6609190"},{"key":"963_CR11","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On Random Graphs I. Publ Math Debr 6:290\u2013297","journal-title":"Publ Math Debr"},{"issue":"4","key":"963_CR12","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. https:\/\/doi.org\/10.1214\/aoms\/1177706098","journal-title":"Ann Math Stat"},{"issue":"4","key":"963_CR13","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0036144500371907","volume":"42","author":"HW Hethcote","year":"2000","unstructured":"Hethcote HW (2000) The mathematics of infectious diseases. SIAM Rev 42(4):599\u2013653. https:\/\/doi.org\/10.1137\/S0036144500371907","journal-title":"SIAM Rev"},{"key":"963_CR14","doi-asserted-by":"publisher","unstructured":"Kiss I, Miller J, Simon P (2017) Mathematics of epidemics on networks. Springer. https:\/\/doi.org\/10.1007\/978-3-319-50806-1","DOI":"10.1007\/978-3-319-50806-1"},{"key":"963_CR15","doi-asserted-by":"publisher","unstructured":"Kwak H, Lee C, Park H, et\u00a0al (2010) What is twitter, a social network or a news media? In: Proceedings of 19th international conference on world wide web. https:\/\/doi.org\/10.1145\/1772690.1772751","DOI":"10.1145\/1772690.1772751"},{"key":"963_CR16","doi-asserted-by":"publisher","unstructured":"Miller JC, Ting T (2019) EoN (Epidemics on Networks): a fast, flexible Python package for simulation, analytic approximation, and analysis of epidemics on networks. J Open Source Softw 4(44):1731. https:\/\/doi.org\/10.21105\/joss.01731","DOI":"10.21105\/joss.01731"},{"key":"963_CR17","doi-asserted-by":"publisher","unstructured":"Mislove A, Marcon M, Gummadi KP, et\u00a0al (2007) Measurement and analysis of online social networks. In: Proceedings of the ACM SIGCOMM conference on internet measurement. https:\/\/doi.org\/10.1145\/1298306.1298311","DOI":"10.1145\/1298306.1298311"},{"key":"963_CR18","doi-asserted-by":"publisher","unstructured":"Myers S, Sharma A, Gupta P, et\u00a0al (2014) Information network or social network?: The structure of the twitter follow graph. In: Proceedings of 23rd International Conference on World Wide Web. https:\/\/doi.org\/10.1145\/2567948.2576939","DOI":"10.1145\/2567948.2576939"},{"issue":"058","key":"963_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1103\/PhysRevLett.103.058701","volume":"103","author":"M Newman","year":"2009","unstructured":"Newman M (2009) Random graphs with clustering. Phys Rev Lett 103(058):701. https:\/\/doi.org\/10.1103\/PhysRevLett.103.058701","journal-title":"Phys Rev Lett"},{"key":"963_CR20","doi-asserted-by":"publisher","unstructured":"Schweimer C, Gfrerer C, Lugstein F, et\u00a0al (2022) Generating simple directed social network graphs for information spreading. In: Proceedings of ACM web conference 2022. https:\/\/doi.org\/10.1145\/3485447.3512194","DOI":"10.1145\/3485447.3512194"},{"issue":"6684","key":"963_CR21","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\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00963-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-022-00963-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00963-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T13:24:38Z","timestamp":1672665878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-022-00963-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["963"],"URL":"https:\/\/doi.org\/10.1007\/s13278-022-00963-z","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2022,9,3]]},"assertion":[{"value":"8 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that there is no competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"127"}}