{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:47:08Z","timestamp":1777178828835,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Insper-Illinois"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Generating high-quality synthetic networks with realistic community structure is vital to effectively evaluate community detection algorithms. In this study, we propose a new synthetic network generator called the Edge-Connected Stochastic Block Model (EC-SBM). The goal of EC-SBM is to take a given clustered real-world network and produce a synthetic network that resembles the clustered real-world network with respect to both network and community-specific criteria. In particular, we focus on simulating the internal edge connectivity of the clusters in the reference clustered network. Our performance study on large real-world networks shows that EC-SBM is generally more accurate with respect to network and community criteria than currently used approaches for this problem. Furthermore, we demonstrate that EC-SBM can complete analyses on several real-world networks with millions of nodes.<\/jats:p>","DOI":"10.1007\/s41109-025-00701-2","type":"journal-article","created":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T10:07:45Z","timestamp":1746094065000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["EC-SBM synthetic network generator"],"prefix":"10.1007","volume":"10","author":[{"given":"The-Anh","family":"Vu-Le","sequence":"first","affiliation":[]},{"given":"Lahari","family":"Anne","sequence":"additional","affiliation":[]},{"given":"George","family":"Chacko","sequence":"additional","affiliation":[]},{"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"key":"701_CR1","unstructured":"Airoldi EM, Blei D, Fienberg S, Xing E (2008) Mixed membership stochastic blockmodels. Adv Neural Inf Process Syst 21"},{"key":"701_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47\u201397. https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev Mod Phys"},{"key":"701_CR4","doi-asserted-by":"publisher","unstructured":"Anne L, Vu-Le T-A, Park M, Warnow T, Chacko G (2025) RECCS: realistic cluster connectivity simulator for synthetic network generation. Advs Complex Syst. https:\/\/doi.org\/10.1142\/s0219525925400041","DOI":"10.1142\/s0219525925400041"},{"issue":"1","key":"701_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1111\/rssb.12117","volume":"78","author":"PJ Bickel","year":"2015","unstructured":"Bickel PJ, Sarkar P (2015) Hypothesis testing for automated community detection in networks. J R Stat Soc Ser B Stat Methodol 78(1):253\u2013273. https:\/\/doi.org\/10.1111\/rssb.12117","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"issue":"4","key":"701_CR6","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":"5","key":"701_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel Emergent Distrib Syst 27(5):387\u2013408","journal-title":"Int J Parallel Emergent Distrib Syst"},{"issue":"1","key":"701_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s41109-020-0252-y","volume":"5","author":"P Chodrow","year":"2020","unstructured":"Chodrow P, Mellor A (2020) Annotated hypergraphs: models and applications. Appl Netw Sci 5(1):9","journal-title":"Appl Netw Sci"},{"key":"701_CR9","doi-asserted-by":"crossref","unstructured":"Chung FRK, Lu L (2006) Complex graphs and networks. In: CBMS regional conference series in mathematics. American Mathematical Society, Providence, RI","DOI":"10.1090\/cbms\/107"},{"issue":"09","key":"701_CR10","doi-asserted-by":"publisher","first-page":"09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, D\u00edaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech: Theory Exp 2005(09):09008. https:\/\/doi.org\/10.1088\/1742-5468\/2005\/09\/P09008","journal-title":"J Stat Mech: Theory Exp"},{"key":"701_CR11","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 (1959) On random graphs I. Publ Math Debrecen 6:290\u2013297","journal-title":"Publ Math Debrecen"},{"issue":"2","key":"701_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/16M1087175","volume":"60","author":"BK Fosdick","year":"2018","unstructured":"Fosdick BK, Larremore DB, Nishimura J, Ugander J (2018) Configuring random graph models with fixed degree sequences. SIAM Rev 60(2):315\u2013355. https:\/\/doi.org\/10.1137\/16M1087175","journal-title":"SIAM Rev"},{"issue":"395","key":"701_CR13","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O Frank","year":"1986","unstructured":"Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81(395):832\u2013842. https:\/\/doi.org\/10.1080\/01621459.1986.10478342","journal-title":"J Am Stat Assoc"},{"issue":"5","key":"701_CR14","doi-asserted-by":"publisher","first-page":"5370","DOI":"10.1109\/TPAMI.2022.3214832","volume":"45","author":"X Guo","year":"2023","unstructured":"Guo X, Zhao L (2023) A systematic survey on deep generative models for graph generation. IEEE Trans Pattern Anal Mach Intell 45(5):5370\u20135390. https:\/\/doi.org\/10.1109\/TPAMI.2022.3214832","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"701_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121649","volume":"691","author":"Z He","year":"2025","unstructured":"He Z, Li X, Hu L, Jiang M, Liu Y (2025) Community structure testing by counting frequent common neighbor sets. Inf Sci 691:121649. https:\/\/doi.org\/10.1016\/j.ins.2024.121649","journal-title":"Inf Sci"},{"issue":"373","key":"701_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1981.10477598","volume":"76","author":"PW Holland","year":"1981","unstructured":"Holland PW, Leinhardt S (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76(373):33\u201350. https:\/\/doi.org\/10.1080\/01621459.1981.10477598","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"701_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Netw 5(2):109\u2013137. https:\/\/doi.org\/10.1016\/0378-8733(83)90021-7","journal-title":"Soc Netw"},{"key":"701_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.062805","volume":"90","author":"D Hric","year":"2014","unstructured":"Hric D, Darst RK, Fortunato S (2014) Community detection in networks: structural communities versus ground truth. Phys Rev E 90:062805. https:\/\/doi.org\/10.1103\/PhysRevE.90.062805","journal-title":"Phys Rev E"},{"key":"701_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-020-00716-6","volume":"35","author":"X Huang","year":"2021","unstructured":"Huang X, Chen D, Ren T, Wang D (2021) A survey of community detection methods in multilayer networks. Data Min Knowl Disc 35:1\u201345","journal-title":"Data Min Knowl Disc"},{"key":"701_CR20","unstructured":"Jang Y, Lee S, Ahn S (2024) A simple and scalable representation for graph generation. In: The twelfth international conference on learning representations"},{"issue":"2","key":"701_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1017\/nws.2020.45","volume":"9","author":"B Kami\u0144ski","year":"2021","unstructured":"Kami\u0144ski B, Pra\u0144at P, Th\u00e9berge F (2021) Artificial benchmark for community detection (ABCD)\u2014fast random graph model with community structure. Netw Sci 9(2):153\u2013178. https:\/\/doi.org\/10.1017\/nws.2020.45","journal-title":"Netw Sci"},{"issue":"1","key":"701_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1017\/nws.2020.45","volume":"8","author":"B Kami\u0144ski","year":"2023","unstructured":"Kami\u0144ski B, Pra\u0144at P, Th\u00e9berge F (2023) Artificial benchmark for community detection with outliers (ABCD+o). Appl Netw Sci 8(1):25. https:\/\/doi.org\/10.1017\/nws.2020.45","journal-title":"Appl Netw Sci"},{"issue":"4","key":"701_CR23","first-page":"028","volume":"11","author":"B Kami\u0144ski","year":"2023","unstructured":"Kami\u0144ski B, Pra\u0142at P, Th\u00e9berge F (2023) Hypergraph artificial benchmark for community detection (h-ABCD). J Complex Netw 11(4):028","journal-title":"J Complex Netw"},{"issue":"3","key":"701_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/2854006.2854013","volume":"44","author":"J Kim","year":"2015","unstructured":"Kim J, Lee J-G (2015) Community detection in multi-layer graphs: a survey. ACM SIGMOD Rec 44(3):37\u201348","journal-title":"ACM SIGMOD Rec"},{"key":"701_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78:046110. https:\/\/doi.org\/10.1103\/PhysRevE.78.046110","journal-title":"Phys Rev E"},{"key":"701_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.046110","volume":"81","author":"A Lancichinetti","year":"2010","unstructured":"Lancichinetti A, Radicchi F, Ramasco JJ (2010) Statistical significance of communities in networks. Phys Rev E 81:046110. https:\/\/doi.org\/10.1103\/PhysRevE.81.046110","journal-title":"Phys Rev E"},{"key":"701_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-38629-0_2","volume-title":"Learning and intelligent optimization","author":"P Miasnikof","year":"2020","unstructured":"Miasnikof P, Prokhorenkova L, Shestopaloff AY, Raigorodskii A (2020) A statistical test of heterogeneous subgraph densities to assess clusterability. In: Matsatsinis NF, Marinakis Y, Pardalos P (eds) Learning and intelligent optimization. Springer, Cham, pp 17\u201329. https:\/\/doi.org\/10.1007\/978-3-030-38629-0_2"},{"issue":"4","key":"701_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s41060-023-00389-6","volume":"15","author":"P Miasnikof","year":"2023","unstructured":"Miasnikof P, Shestopaloff AY, Raigorodskii A (2023) Statistical power, accuracy, reproducibility and robustness of a graph clusterability test. Int J Data Sci Anal 15(4):379\u2013390. https:\/\/doi.org\/10.1007\/s41060-023-00389-6","journal-title":"Int J Data Sci Anal"},{"issue":"5","key":"701_CR29","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aac06f","volume":"20","author":"A Muscoloni","year":"2018","unstructured":"Muscoloni A, Cannistraci CV (2018) A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities. New J Phys 20(5):052002. https:\/\/doi.org\/10.1088\/1367-2630\/aac06f","journal-title":"New J Phys"},{"key":"701_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113. https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys Rev E"},{"issue":"11","key":"701_CR31","doi-asserted-by":"publisher","first-page":"283","DOI":"10.4156\/jcit.vol6.issue11.32","volume":"6","author":"GK Orman","year":"2011","unstructured":"Orman GK, Labatut V, Cherifi H (2011) On accuracy of community structure discovery algorithms. J Converg Inf Technol 6(11):283\u2013292. https:\/\/doi.org\/10.4156\/jcit.vol6.issue11.32","journal-title":"J Converg Inf Technol"},{"issue":"08","key":"701_CR32","doi-asserted-by":"publisher","first-page":"08001","DOI":"10.1088\/1742-5468\/2012\/08\/P08001","volume":"2012","author":"GK Orman","year":"2012","unstructured":"Orman GK, Labatut V, Cherifi H (2012) Comparative evaluation of community detection algorithms: a topological approach. J Stat Mech: Theory Exp 2012(08):08001. https:\/\/doi.org\/10.1088\/1742-5468\/2012\/08\/P08001","journal-title":"J Stat Mech: Theory Exp"},{"issue":"3","key":"701_CR33","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1504\/IJWBC.2013.054908","volume":"9","author":"GK Orman","year":"2013","unstructured":"Orman GK, Labatut V, Cherifi H (2013) Towards realistic artificial benchmark for community detection algorithms evaluation. Int J Web Based Communities 9(3):349\u2013370. https:\/\/doi.org\/10.1504\/IJWBC.2013.054908","journal-title":"Int J Web Based Communities"},{"issue":"3","key":"701_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcsy.0000009","volume":"1","author":"M Park","year":"2024","unstructured":"Park M, Tabatabaee Y, Ramavarapu V, Liu B, Pailodi VK, Ramachandran R, Korobskiy D, Ayres F, Chacko G, Warnow T (2024) Well-connectedness and community detection. PLOS Complex Syst 1(3):1\u201325. https:\/\/doi.org\/10.1371\/journal.pcsy.0000009","journal-title":"PLOS Complex Syst"},{"key":"701_CR35","doi-asserted-by":"crossref","unstructured":"Park M, Feng DW, Digra S, Vu-Le T-A, Chacko G, Warnow T (2024) Improved community detection using stochastic block models. arXiv:2408.10464","DOI":"10.1007\/978-3-031-82435-7_9"},{"key":"701_CR36","doi-asserted-by":"publisher","unstructured":"Peixoto TP (2014). The graph-tool python library figshare. https:\/\/doi.org\/10.6084\/m9.figshare.1164194. Accessed 10 September 2014","DOI":"10.6084\/m9.figshare.1164194"},{"key":"701_CR37","doi-asserted-by":"publisher","unstructured":"Peixoto TP (2019) Bayesian stochastic blockmodeling. Wiley. https:\/\/doi.org\/10.1002\/9781119483298.ch11","DOI":"10.1002\/9781119483298.ch11"},{"key":"701_CR38","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7839981","author":"TP Peixoto","year":"2023","unstructured":"Peixoto TP (2023) The Netzschleuder network catalogue and repository. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.7839981","journal-title":"Zenodo"},{"issue":"2","key":"701_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti G, Cazabet R (2018) Community discovery in dynamic networks: a survey. ACM Comput Surv (CSUR) 51(2):1\u201337","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"4","key":"701_CR40","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118\u20131123. https:\/\/doi.org\/10.1073\/pnas.0706851105","journal-title":"Proc Natl Acad Sci"},{"key":"701_CR41","unstructured":"Traag V (2019) Leiden algorithm: leidenalg. https:\/\/github.com\/vtraag\/leidenalg"},{"issue":"1","key":"701_CR42","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag VA, Waltman L, Eck NJ (2019) From Louvain to Leiden: guaranteeing well-connected communities. Sci Rep 9(1):5233. https:\/\/doi.org\/10.1038\/s41598-019-41695-z","journal-title":"Sci Rep"},{"key":"701_CR43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.105.054311","volume":"105","author":"F Vaca-Ram\u00edrez","year":"2022","unstructured":"Vaca-Ram\u00edrez F, Peixoto TP (2022) Systematic assessment of the quality of fit of the stochastic block model for empirical networks. Phys Rev E 105:054311. https:\/\/doi.org\/10.1103\/PhysRevE.105.054311","journal-title":"Phys Rev E"},{"issue":"2","key":"701_CR44","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1017\/nws.2024.1","volume":"12","author":"E Yanchenko","year":"2024","unstructured":"Yanchenko E, Sengupta S (2024) A generalized hypothesis test for community structure in networks. Netw Sci 12(2):122\u2013138. https:\/\/doi.org\/10.1017\/nws.2024.1","journal-title":"Netw Sci"},{"issue":"1","key":"701_CR45","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6(1):30750. https:\/\/doi.org\/10.1038\/srep30750","journal-title":"Sci Rep"},{"key":"701_CR46","unstructured":"You J, Ying R, Ren X, Hamilton W, Leskovec J (2018) GraphRNN: Generating realistic graphs with deep auto-regressive models. In: Dy J, Krause A (eds.) Proceedings of the 35th international conference on machine learning. Proceedings of machine learning research, PMLR, vol 80, pp 5708\u20135717. https:\/\/proceedings.mlr.press\/v80\/you18a.html"},{"issue":"2","key":"701_CR47","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1137\/19M1272238","volume":"2","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Levina E, Zhu J (2020) Detecting overlapping communities in networks using spectral methods. SIAM J Math Data Sci 2(2):265\u2013283","journal-title":"SIAM J Math Data Sci"},{"key":"701_CR48","unstructured":"Zhu Y, Du Y, Wang Y, Xu Y, Zhang J, Liu Q, Wu S (2022) A survey on deep graph generation: methods and applications. In: Learning on graphs conference. PMLR, pp 47\u20131"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00701-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00701-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00701-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T10:07:50Z","timestamp":1746094070000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00701-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,1]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00701-2","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,1]]},"assertion":[{"value":"5 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"15"}}