{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T05:01:40Z","timestamp":1784523700521,"version":"3.55.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004385","name":"Universiteit Gent","doi-asserted-by":"publisher","award":["BOF.24Y.2019.0010.01 and bof\/baf\/4y\/2024\/01\/806 and BOF\/STA\/202009\/039"],"award-info":[{"award-number":["BOF.24Y.2019.0010.01 and bof\/baf\/4y\/2024\/01\/806 and BOF\/STA\/202009\/039"]}],"id":[{"id":"10.13039\/501100004385","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00607-026-01717-x","type":"journal-article","created":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T04:12:02Z","timestamp":1784520722000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantifying randomness in complex graph sets using pairwise graph distances"],"prefix":"10.1007","volume":"108","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2087-6993","authenticated-orcid":false,"given":"Bram","family":"Mornie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Didier","family":"Colle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pieter","family":"Audenaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mario","family":"Pickavet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"5439","key":"1717_CR1","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":"6684","key":"1717_CR2","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"},{"issue":"177","key":"1717_CR3","first-page":"1","volume":"18","author":"E Abbe","year":"2018","unstructured":"Abbe E (2018) Community detection and stochastic block models: recent developments. J Mach Learn Res 18(177):1\u201386 (http:\/\/jmlr.org\/papers\/v18\/16-480.html)","journal-title":"J Mach Learn Res"},{"issue":"2","key":"1717_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1038\/s41592-019-0690-6","volume":"17","author":"A Pratapa","year":"2020","unstructured":"Pratapa A, Jalihal AP, Law JN et al (2020) Benchmarking algorithms for gene regulatory network inference from single-cell transcriptomic data. Nat Methods 17(2):147\u2013154. https:\/\/doi.org\/10.1038\/s41592-019-0690-6","journal-title":"Nat Methods"},{"key":"1717_CR5","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.csbj.2024.07.005","volume":"23","author":"VC Pezoulas","year":"2024","unstructured":"Pezoulas VC, Zaridis DI, Mylona E et al (2024) Synthetic data generation methods in healthcare: a review on open-source tools and methods. Comput Struct Biotechnol J 23:2892\u20132910. https:\/\/doi.org\/10.1016\/j.csbj.2024.07.005","journal-title":"Comput Struct Biotechnol J"},{"issue":"2","key":"1717_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256. https:\/\/doi.org\/10.1137\/S003614450342480","journal-title":"SIAM Rev"},{"issue":"5594","key":"1717_CR7","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S et al (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827. https:\/\/doi.org\/10.1126\/science.298.5594.824","journal-title":"Science"},{"issue":"4","key":"1717_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0010012","volume":"5","author":"CI Del Genio","year":"2010","unstructured":"Del Genio CI, Kim H, Toroczkai Z et al (2010) Efficient and exact sampling of simple graphs with given arbitrary degree sequence. PLoS ONE 5(4):1\u20137. https:\/\/doi.org\/10.1371\/journal.pone.0010012","journal-title":"PLoS ONE"},{"issue":"2","key":"1717_CR9","doi-asserted-by":"publisher","first-page":"023012","DOI":"10.1088\/1367-2630\/14\/2\/023012","volume":"14","author":"H Kim","year":"2012","unstructured":"Kim H, Del Genio CI, Bassler KE et al (2012) Constructing and sampling directed graphs with given degree sequences. New J Phys 14(2):023012. https:\/\/doi.org\/10.1088\/1367-2630\/14\/2\/023012","journal-title":"New J Phys"},{"issue":"1","key":"1717_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S Shen-Orr","year":"2002","unstructured":"Shen-Orr S, Milo R, Mangan S et al (2002) Network motifs in the transcriptional regulation network of escherichia coli. Nat Genet 31(1):64\u201368. https:\/\/doi.org\/10.1038\/ng881","journal-title":"Nat Genet"},{"issue":"18","key":"1717_CR11","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj N, Corneil DG, Jurisica I (2004) Modeling interactome: scale-free or geometric? Bioinformatics 20(18):3508\u20133515. https:\/\/doi.org\/10.1093\/bioinformatics\/bth436","journal-title":"Bioinformatics"},{"issue":"2","key":"1717_CR12","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj N (2007) Biological network comparison using graphlet degree distribution. Bioinformatics 23(2):e177\u2013e183. https:\/\/doi.org\/10.1093\/bioinformatics\/btl301","journal-title":"Bioinformatics"},{"issue":"8","key":"1717_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0106132","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, L\u00fc J, Yu X (2014) Identification of important nodes in directed biological networks: a network motif approach. PLoS ONE 9(8):1\u201315. https:\/\/doi.org\/10.1371\/journal.pone.0106132","journal-title":"PLoS ONE"},{"issue":"13","key":"1717_CR14","doi-asserted-by":"publisher","first-page":"6480","DOI":"10.1093\/nar\/gky468","volume":"46","author":"J Defoort","year":"2018","unstructured":"Defoort J, Van de Peer Y, Vermeirssen V (2018) Function, dynamics and evolution of network motif modules in integrated gene regulatory networks of worm and plant. Nucleic Acids Res 46(13):6480\u20136503. https:\/\/doi.org\/10.1093\/nar\/gky468","journal-title":"Nucleic Acids Res"},{"key":"1717_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.comcom.2015.07.002","volume":"73","author":"A Topirceanu","year":"2016","unstructured":"Topirceanu A, Duma A, Udrescu M (2016) Uncovering the fingerprint of online social networks using a network motif based approach. Comput Commun 73:167\u2013175. https:\/\/doi.org\/10.1016\/j.comcom.2015.07.002. (online Social Networks)","journal-title":"Comput Commun"},{"issue":"4","key":"1717_CR16","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1109\/TNSE.2022.3163203","volume":"9","author":"X Zhang","year":"2022","unstructured":"Zhang X, Xu L, Xu Z (2022) Influence maximization based on network motifs in mobile social networks. EEE Trans Netw Sci Eng 9(4):2353\u20132363. https:\/\/doi.org\/10.1109\/TNSE.2022.3163203","journal-title":"EEE Trans Netw Sci Eng"},{"key":"1717_CR17","doi-asserted-by":"publisher","first-page":"1.1","DOI":"10.1145\/1963190.2063515","volume":"16","author":"L Tabourier","year":"2011","unstructured":"Tabourier L, Roth C, Cointet JP (2011) Generating constrained random graphs using multiple edge switches. J Exp Algorithmics (JEA) 16:1.1-1.15. https:\/\/doi.org\/10.1145\/1963190.2063515","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"1","key":"1717_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1017\/nws.2015.35","volume":"4","author":"T Tao","year":"2016","unstructured":"Tao T (2016) An improved MCMC algorithm for generating random graphs from constrained distributions. Netw Sci 4(1):117\u2013139. https:\/\/doi.org\/10.1017\/nws.2015.35","journal-title":"Netw Sci"},{"issue":"1","key":"1717_CR19","doi-asserted-by":"publisher","first-page":"cnae002","DOI":"10.1093\/comnet\/cnae002","volume":"12","author":"L Tabourier","year":"2024","unstructured":"Tabourier L, Karadayi J (2024) Probabilistic k-swap method for uniform graph generation beyond the configuration model. J Complex Netw 12(1):cnae002. https:\/\/doi.org\/10.1093\/comnet\/cnae002","journal-title":"J Complex Netw"},{"key":"1717_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-54241-6_2","volume-title":"Complex Networks VIII","author":"ME Silva","year":"2017","unstructured":"Silva ME, Paredes P, Ribeiro P (2017) Network motifs detection using random networks with prescribed subgraph frequencies. Complex Networks VIII. Springer International Publishing, pp 17\u201329"},{"issue":"8","key":"1717_CR21","doi-asserted-by":"publisher","first-page":"e0328639","DOI":"10.1371\/journal.pone.0328639","volume":"20","author":"B Mornie","year":"2025","unstructured":"Mornie B, Colle D, Audenaert P et al (2025) Generating random graphs with prescribed graphlet frequency bounds derived from probabilistic networks. PLoS ONE 20(8):e0328639. https:\/\/doi.org\/10.1371\/journal.pone.0328639","journal-title":"PLoS ONE"},{"key":"1717_CR22","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1145\/3366423.3380201","volume":"2020","author":"N Goyal","year":"2020","unstructured":"Goyal N, Jain HV, Ranu S (2020) GraphGen: a scalable approach to domain-agnostic labeled graph generation. Proc ACM Web Conf 2020:1253\u20131263. https:\/\/doi.org\/10.1145\/3366423.3380201","journal-title":"Proc ACM Web Conf"},{"key":"1717_CR23","doi-asserted-by":"publisher","unstructured":"Gamage A, Chien E, Peng J, et\u00a0al (2020) Multi-motifgan (mmgan): motif-targeted graph generation and prediction. In: ICASSP 2020 - 2020 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 4182\u20134186, https:\/\/doi.org\/10.1109\/ICASSP40776.2020.9053451","DOI":"10.1109\/ICASSP40776.2020.9053451"},{"issue":"1","key":"1717_CR24","doi-asserted-by":"publisher","first-page":"17557","DOI":"10.1038\/s41598-019-53708-y","volume":"9","author":"M Tantardini","year":"2019","unstructured":"Tantardini M, Ieva F, Tajoli L et al (2019) Comparing methods for comparing networks. Sci Rep 9(1):17557. https:\/\/doi.org\/10.1038\/s41598-019-53708-y","journal-title":"Sci Rep"},{"key":"1717_CR25","doi-asserted-by":"publisher","unstructured":"Koutra D, Vogelstein JT, Faloutsos C (2013) DeltaCon: a principled massive-graph similarity function. In: Proceedings of the 2013 SIAM international conference on data mining (SDM), pp 162\u2013170, https:\/\/doi.org\/10.1137\/1.9781611972832.18","DOI":"10.1137\/1.9781611972832.18"},{"issue":"1","key":"1717_CR26","doi-asserted-by":"publisher","first-page":"5134","DOI":"10.1038\/s41598-018-21532-5","volume":"8","author":"Q Liu","year":"2018","unstructured":"Liu Q, Dong Z, Wang E (2018) Cut based method for comparing complex networks. Sci Rep 8(1):5134. https:\/\/doi.org\/10.1038\/s41598-018-21532-5","journal-title":"Sci Rep"},{"key":"1717_CR27","doi-asserted-by":"publisher","first-page":"57993","DOI":"10.52202\/079017-1849","volume":"37","author":"F Velikonivtsev","year":"2024","unstructured":"Velikonivtsev F, Mironov M, Prokhorenkova L (2024) Challenges of generating structurally diverse graphs. Adv Neural Inf Process Syst 37:57993\u201358022","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"1717_CR28","doi-asserted-by":"publisher","first-page":"28005","DOI":"10.1209\/0295-5075\/81\/28005","volume":"81","author":"G Bianconi","year":"2007","unstructured":"Bianconi G (2007) The entropy of randomized network ensembles. Europhys Lett 81(2):28005. https:\/\/doi.org\/10.1209\/0295-5075\/81\/28005","journal-title":"Europhys Lett"},{"key":"1717_CR29","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.csda.2016.11.016","volume":"109","author":"A Fujita","year":"2017","unstructured":"Fujita A, Takahashi DY, Balardin JB et al (2017) Correlation between graphs with an application to brain network analysis. Comput Stat Data Anal 109:76\u201392. https:\/\/doi.org\/10.1016\/j.csda.2016.11.016","journal-title":"Comput Stat Data Anal"},{"key":"1717_CR30","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. Publicationes Mathematicae Debrecen 6:290\u2013297. https:\/\/doi.org\/10.5486\/pmd.1959.6.3-4.12","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"2243","key":"1717_CR31","doi-asserted-by":"publisher","first-page":"20190744","DOI":"10.1098\/rspa.2019.0744","volume":"476","author":"H Hartle","year":"2020","unstructured":"Hartle H, Klein B, McCabe S et al (2020) Network comparison and the within-ensemble graph distance. Proc R Soc A 476(2243):20190744. https:\/\/doi.org\/10.1098\/rspa.2019.0744","journal-title":"Proc R Soc A"},{"key":"1717_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D et al (2010) A survey of graph edit distance. Pattern Anal Appl 13:113\u2013129. https:\/\/doi.org\/10.1007\/s10044-008-0141-y","journal-title":"Pattern Anal Appl"},{"key":"1717_CR33","unstructured":"Berlingerio M, Koutra D, Eliassi-Rad T, et al (2012) NetSimile: a scalable approach to size-independent network similarity. arXiv:1209.2684"},{"key":"1717_CR34","doi-asserted-by":"publisher","unstructured":"Roy M, Schmid S, Tredan G (2014) Modeling and measuring graph similarity: the case for centrality distance. In: Proceedings of the 10th ACM international workshop on foundations of mobile computing. Association for Computing Machinery, New York, NY, USA, p 47\u201352, https:\/\/doi.org\/10.1145\/2634274.2634277","DOI":"10.1145\/2634274.2634277"},{"issue":"1","key":"1717_CR35","doi-asserted-by":"publisher","first-page":"4547","DOI":"10.1038\/srep04547","volume":"4","author":"\u00d6N Yavero\u011flu","year":"2014","unstructured":"Yavero\u011flu \u00d6N, Malod-Dognin N, Davis D et al (2014) Revealing the hidden language of complex networks. Sci Rep 4(1):4547. https:\/\/doi.org\/10.1038\/srep04547","journal-title":"Sci Rep"},{"issue":"1","key":"1717_CR36","doi-asserted-by":"publisher","first-page":"14890","DOI":"10.1038\/s41598-017-14411-y","volume":"7","author":"FE Faisal","year":"2017","unstructured":"Faisal FE, Newaz K, Chaney JL et al (2017) GRAFENE: graphlet-based alignment-free network approach integrates 3d structural and sequence (residue order) data to improve protein structural comparison. Sci Rep 7(1):14890. https:\/\/doi.org\/10.1038\/s41598-017-14411-y","journal-title":"Sci Rep"},{"issue":"9","key":"1717_CR37","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1016\/j.patcog.2008.03.011","volume":"41","author":"RC Wilson","year":"2008","unstructured":"Wilson RC, Zhu P (2008) A study of graph spectra for comparing graphs and trees. Pattern Recogn 41(9):2833\u20132841. https:\/\/doi.org\/10.1016\/j.patcog.2008.03.011","journal-title":"Pattern Recogn"},{"key":"1717_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-017-0042-3","volume":"3","author":"R Gera","year":"2018","unstructured":"Gera R, Alonso L, Crawford B et al (2018) Identifying network structure similarity using spectral graph theory. Appl Netw Sci 3:1\u201315. https:\/\/doi.org\/10.1007\/s41109-017-0042-3","journal-title":"Appl Netw Sci"},{"key":"1717_CR39","doi-asserted-by":"publisher","unstructured":"Tsitsulin A, Mottin D, Karras P, et\u00a0al (2018) Netlsd: Hearing the shape of a graph. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. Association for Computing Machinery, New York, NY, USA, p 2347\u20132356, https:\/\/doi.org\/10.1145\/3219819.3219991","DOI":"10.1145\/3219819.3219991"},{"key":"1717_CR40","unstructured":"Amanatidis Y, Green B, Mihail M (2008) Graphic realizations of joint-degree matrices. Unpublished manuscript"},{"key":"1717_CR41","unstructured":"Xie Y, Xu Z, Ma J, et al (2023) How much space has been explored? measuring the chemical space covered by databases and machine-generated molecules. In: The Eleventh international conference on learning representations"},{"key":"1717_CR42","unstructured":"Dan Friedman D, Dieng AB (2023) The vendi score: a diversity evaluation metric for machine learning. Trans Mach Learn Res"},{"key":"1717_CR43","unstructured":"Mironov M, Prokhorenkova L (2025) Measuring diversity: axioms and challenges. arXiv:2410.14556"},{"key":"1717_CR44","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random geometric graphs","author":"M Penrose","year":"2003","unstructured":"Penrose M (2003) Random geometric graphs, vol 5. OUP Oxford"},{"issue":"D1","key":"1717_CR45","doi-asserted-by":"publisher","first-page":"D648","DOI":"10.1093\/nar\/gkab1006","volume":"50","author":"N Del Toro","year":"2022","unstructured":"Del Toro N, Shrivastava A, Ragueneau E et al (2022) The IntAct database: efficient access to fine-grained molecular interaction data. Nucleic Acids Res 50(D1):D648\u2013D653. https:\/\/doi.org\/10.1093\/nar\/gkab1006","journal-title":"Nucleic Acids Res"},{"issue":"D1","key":"1717_CR46","doi-asserted-by":"publisher","first-page":"D857","DOI":"10.1093\/nar\/gkr930","volume":"40","author":"L Licata","year":"2012","unstructured":"Licata L, Briganti L, Peluso D et al (2012) MINT, the molecular interaction database: 2012 update. Nucleic Acids Res 40(D1):D857\u2013D861. https:\/\/doi.org\/10.1093\/nar\/gkr930","journal-title":"Nucleic Acids Res"},{"issue":"4","key":"1717_CR47","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/0140-1750(88)90080-2","volume":"11","author":"LC Freeman","year":"1988","unstructured":"Freeman LC, Freeman SC, Michaelson AG (1988) On human social intelligence. J Soc and Biol Struct 11(4):415\u2013425","journal-title":"J Soc and Biol Struct"},{"key":"1717_CR48","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) KONECT \u2013 The koblenz network collection. In: WWW \u201913 companion: proceedings of the 22nd international conference on world wide Web, pp 1343\u20131350, http:\/\/dl.acm.org\/citation.cfm?id=2488173","DOI":"10.1145\/2487788.2488173"},{"key":"1717_CR49","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104. https:\/\/doi.org\/10.1103\/PhysRevE.74.036104","journal-title":"Phys Rev E"},{"key":"1717_CR50","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"4","key":"1717_CR51","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1151659.1159930","volume":"36","author":"P Mahadevan","year":"2006","unstructured":"Mahadevan P, Krioukov D, Fall K et al (2006) Systematic topology analysis and generation using degree correlations. SIGCOMM Comput Commun Rev 36(4):135\u2013146. https:\/\/doi.org\/10.1145\/1151659.1159930","journal-title":"SIGCOMM Comput Commun Rev"},{"issue":"1","key":"1717_CR52","doi-asserted-by":"publisher","first-page":"8627","DOI":"10.1038\/ncomms9627","volume":"6","author":"C Orsini","year":"2015","unstructured":"Orsini C, Dankulov MM, Colomer-de Sim\u00f3n P et al (2015) Quantifying randomness in real networks. Nat Commun 6(1):8627. https:\/\/doi.org\/10.1038\/ncomms9627","journal-title":"Nat Commun"},{"key":"1717_CR53","doi-asserted-by":"publisher","unstructured":"Davis J, Goadrich M (2006) The relationship between precision-recall and roc curves. In: Proceedings of the 23rd international conference on machine learning. Association for Computing Machinery, New York, NY, USA, pp 233\u2013240, https:\/\/doi.org\/10.1145\/1143844.1143874","DOI":"10.1145\/1143844.1143874"},{"key":"1717_CR54","volume-title":"Random graphs","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Random graphs. Springer"},{"key":"1717_CR55","doi-asserted-by":"publisher","first-page":"056708","DOI":"10.1103\/PhysRevE.72.056708","volume":"72","author":"Y Artzy-Randrup","year":"2005","unstructured":"Artzy-Randrup Y, Stone L (2005) Generating uniformly distributed random networks. Phys Rev E 72:056708. https:\/\/doi.org\/10.1103\/PhysRevE.72.056708","journal-title":"Phys Rev E"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-026-01717-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-026-01717-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-026-01717-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T04:12:05Z","timestamp":1784520725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-026-01717-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"references-count":55,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1717"],"URL":"https:\/\/doi.org\/10.1007\/s00607-026-01717-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"5 March 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"122"}}