{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:01:39Z","timestamp":1766484099632,"version":"3.41.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"DFG","award":["ME 3619\/3-1"],"award-info":[{"award-number":["ME 3619\/3-1"]}]},{"name":"DFG","award":["WA 654\/22-2"],"award-info":[{"award-number":["WA 654\/22-2"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1522751"],"award-info":[{"award-number":["1522751"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1647361"],"award-info":[{"award-number":["1647361"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015463","name":"Karlsruhe House of Young Scientists","doi-asserted-by":"crossref","award":["International Collaboration Package"],"award-info":[{"award-number":["International Collaboration Package"]}],"id":[{"id":"10.13039\/100015463","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s41109-017-0054-z","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T11:10:32Z","timestamp":1507893032000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Generating realistic scaled complex networks"],"prefix":"10.1007","volume":"2","author":[{"given":"Christian L.","family":"Staudt","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hamann","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gutfraind","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6284-7408","authenticated-orcid":false,"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,13]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W, Chung F, Lu L (2000) A random graph model for massive graphs In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, 171\u2013180.. ACM.","DOI":"10.1145\/335305.335326"},{"issue":"1","key":"54_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 (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47.","journal-title":"Rev Mod Phys"},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"Bader, DA, Meyerhenke H, Sanders P, Schulz C, Kappes A, Wagner D (2014) Benchmarking for graph clustering and partitioning In: Encyclopedia of Social Network Analysis and Mining, 73\u201382.. Springer.","DOI":"10.1007\/978-1-4614-6170-8_23"},{"issue":"1","key":"54_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1186\/1471-2105-10-405","volume":"10","author":"S Bansal","year":"2009","unstructured":"Bansal, S, Khandelwal S, Meyers L (2009) Exploring biological network structure with clustered random networks. BMC Bioinforma 10(1):405.","journal-title":"BMC Bioinforma"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. http:\/\/view.ncbi.nlm.nih.gov\/pubmed\/10521342 .","DOI":"10.1126\/science.286.5439.509"},{"issue":"3","key":"54_CR6","doi-asserted-by":"publisher","first-page":"036","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V, Brandes U (2005) Efficient generation of large random networks. Phys Rev E 71(3):036\u2013113.","journal-title":"Phys Rev E"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1126\/science.1166681","volume":"322","author":"PM Binder","year":"2008","unstructured":"Binder, PM (2008) Frustration in complexity. Science 322:323.","journal-title":"Science"},{"issue":"4","key":"54_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti, S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: Structure and dynamics. Phys Reports 424(4):175\u2013308.","journal-title":"Phys Reports"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Brandt, A (2001) Multiscale scientific computation: Review 2001. In: Barth T, Haimes R, Chan T (eds)Multiscale and Multiresolution Methods (Proceedings of the Yosemite Educational Symposium, October 2000).. Springer-Verlag.","DOI":"10.1007\/978-3-642-56205-1_1"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"Brandt, A, Ron D (2003) Chapter 1: Multigrid solvers and multilevel optimization strategies. In: Cong J Shinnerl JR (eds)Multilevel Optimization and VLSICAD.. Kluwer.","DOI":"10.1007\/978-1-4757-3748-6_1"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Brase, JM, Brown DL (2009) Modeling, simulation and analysis of complex networked systems - a program plan. Lawrence Livermore National Laboratory.","DOI":"10.2172\/1020327"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Briggs, WL, Henson V, McCormick SF (2000) A multigrid tutorial: second edition. Society for Industrial and Applied Mathematics, Philadelphia.","DOI":"10.1137\/1.9780898719505"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning In: Algorithm Engineering, 117\u2013158.. Springer.","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Caldarelli, G, Vespignani A (2007) Large scale structure and dynamics of complex networks. World Scientific 2017.","DOI":"10.1142\/6455"},{"issue":"Suppl 1","key":"54_CR15","doi-asserted-by":"publisher","first-page":"2538","DOI":"10.1073\/pnas.012582499","volume":"99","author":"J Carlson","year":"2002","unstructured":"Carlson, J, Doyle J (2002) Complexity and robustness. Proc Natl Acad Sci U S A 99(Suppl 1):2538.","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"1","key":"54_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti, D, Faloutsos C (2006) Graph mining: Laws, generators, and algorithms. ACM Comput Surv (CSUR) 38(1):2.","journal-title":"ACM Comput Surv (CSUR)"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D, Zhan Y, Faloutsos C (2004) R-MAT: A recursive model for graph mining. In: Berry MW, Dayal U, Kamath C, Skillicorn DB (eds)Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, USA, April 22-24, 2004, 442\u2013446.. SIAM. doi: 10.1137\/1.9781611972740.43 . https:\/\/doi.org\/10.1137\/1.9781611972740.43 .","DOI":"10.1137\/1.9781611972740.43"},{"issue":"4","key":"54_CR18","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A, Shalizi CR, Newman ME (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661\u2013703.","journal-title":"SIAM Rev"},{"key":"54_CR19","doi-asserted-by":"crossref","unstructured":"Dasari, NS, Ranjan D, Zubair M (2014) ParK: An efficient algorithm for k-core decomposition on multicore processors In: 2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, October 27-30 2014, 9\u201316.. IEEE.","DOI":"10.1109\/BigData.2014.7004366"},{"key":"54_CR20","unstructured":"Dunlavy, D, Hendrickson B, Kolda T (2009) Mathematical challenges in cybersecurity. Tech. rep. Sandia National Laboratory."},{"key":"54_CR21","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17\u201361.","journal-title":"Publ Math Inst Hung Acad Sci"},{"issue":"6988","key":"54_CR22","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1038\/nature02541","volume":"429","author":"S Eubank","year":"2004","unstructured":"Eubank, S, Guclu H, Kumar V, Marathe M, Srinivasan A, Toroczkai Z, Wang N (2004) Modelling disease outbreaks in realistic urban social networks. Nature 429(6988):180\u2013184.","journal-title":"Nature"},{"key":"54_CR23","unstructured":"Fortunato, S (2017) Benchmark graphs to test community detection algorithms. https:\/\/sites.google.com\/site\/santofortunato\/inthepress2 . Accessed 30 July 2017."},{"key":"54_CR24","doi-asserted-by":"crossref","unstructured":"Geisberger, R, Sanders P, Schultes D (2008) Better approximation of betweenness centrality In: Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX, 90\u2013100.. SIAM.","DOI":"10.1137\/1.9781611972887.9"},{"issue":"1","key":"54_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2851496","volume":"21","author":"R Glantz","year":"2016","unstructured":"Glantz, R, Meyerhenke H, Schulz C (2016) Tree-based coarsening and partitioning of complex networks. J Exper Algorithmics (JEA) 21(1):1\u20136.","journal-title":"J Exper Algorithmics (JEA)"},{"issue":"2","key":"54_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1561\/2200000005","volume":"2","author":"A Goldenberg","year":"2010","unstructured":"Goldenberg, A, Zheng AX, Fienberg SE, Airoldi EM (2010) A survey of statistical network models. Found Trends \u24c7 Mach Learn 2(2):129\u2013233.","journal-title":"Found Trends\u24c7 Mach Learn"},{"key":"54_CR27","unstructured":"Gutfraind, A, Meyers L, Safro I (2012) MUSKETEER: Multiscale entropic network generator. https:\/\/people.cs.clemson.edu\/~isafro\/musketeer\/index.html . Accessed 30 July 2017."},{"key":"54_CR28","unstructured":"Gutfraind, A, Safro I, Meyers LA (2015) Multiscale network generation In: Information Fusion (Fusion), 2015 18th International Conference on, 158\u2013165.. IEEE."},{"issue":"1","key":"54_CR29","first-page":"22:1","volume":"6","author":"M Hamann","year":"2016","unstructured":"Hamann, M, Lindner G, Meyerhenke H, Staudt CL, Wagner D (2016) Structure-preserving sparsification methods for social networks. Soc Netw Anal Mining 6(1):22:1\u201322:22.","journal-title":"Soc Netw Anal Mining"},{"issue":"1","key":"54_CR30","doi-asserted-by":"publisher","first-page":"016","DOI":"10.1103\/PhysRevE.71.016127","volume":"71","author":"S Itzkovitz","year":"2005","unstructured":"Itzkovitz, S, Levitt R, Kashta N, Milo R, Itzkovitz M, Alon U (2005) Coarse-graining and self-dissimilarity of complex networks. Phys Rev E 71(1):016\u2013127.","journal-title":"Phys Rev E"},{"key":"54_CR31","doi-asserted-by":"crossref","unstructured":"Keeling, MJ, Rohani P (2008) Modeling infectious diseases in humans and animals, vol. 47. Princeton University Press. http:\/\/webcat.warwick.ac.uk\/record=b2218542S1 .","DOI":"10.1515\/9781400841035"},{"key":"54_CR32","unstructured":"Kolda, TG, Pinar A (2014) SNL: Feastpack. http:\/\/www.sandia.gov\/~tgkolda\/feastpack\/ . Accessed 30 July 2017."},{"key":"54_CR33","doi-asserted-by":"crossref","unstructured":"Kolda, TG, Pinar A, Plantenga T, Seshadhri C (2013) A scalable generative graph model with community structure. arXiv preprint arXiv: 1302.6636. SIAM J Sci Comput 36(5):C424\u2013C452. https:\/\/doi.org\/10.1137\/130914218 .","DOI":"10.1137\/130914218"},{"issue":"066123","key":"54_CR34","doi-asserted-by":"publisher","first-page":"066123","DOI":"10.1103\/PhysRevE.63.066123","volume":"63","author":"PL Krapivsky","year":"2001","unstructured":"Krapivsky, PL, Redner S (2001) Organization of growing random networks. Phys Rev E 63(066123):066123.","journal-title":"Phys Rev E"},{"key":"54_CR35","doi-asserted-by":"publisher","first-page":"036","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D, Papadopoulos F, Kitsak M, Vahdat A, Bogu\u00f1\u00e1 M (2010) Hyperbolic geometry of complex networks. Phys Rev E 82:036\u2013106.","journal-title":"Phys Rev E"},{"key":"54_CR36","doi-asserted-by":"crossref","unstructured":"Kunegis, J (2013) Konect: the koblenz network collection In: Proceedings of the 22nd international conference on World Wide Web companion, 1343\u20131350.. ACM.","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"54_CR37","doi-asserted-by":"publisher","first-page":"016","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016\u2013118.","journal-title":"Phys Rev E"},{"issue":"4","key":"54_CR38","doi-asserted-by":"publisher","first-page":"046","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(4):046\u2013110.","journal-title":"Phys Rev E"},{"key":"54_CR39","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: An approach to modeling networks. J Mach Learn Res 11:985\u20131042.","journal-title":"J Mach Learn Res"},{"key":"54_CR40","doi-asserted-by":"crossref","unstructured":"Leskovec, J, Faloutsos C (2007) Scalable modeling of real graphs using kronecker multiplication In: Proc. 24th Intl. Conference on Machine learning, 497\u2013504.. ACM.","DOI":"10.1145\/1273496.1273559"},{"key":"54_CR41","doi-asserted-by":"crossref","unstructured":"Leskovec, J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, 177\u2013187.. ACM.","DOI":"10.1145\/1081870.1081893"},{"key":"54_CR42","unstructured":"Leskovec, J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data . Accessed 30 July 2017."},{"key":"54_CR43","doi-asserted-by":"crossref","unstructured":"Leskovec, J, Lang K, Dasgupta A, Mahoney M (2008) Statistical properties of community structure in large social and information networks In: Proceeding of the 17th international conference on World Wide Web, 695\u2013704.. ACM.","DOI":"10.1145\/1367497.1367591"},{"key":"54_CR44","unstructured":"Leskovec, J, Sosi\u010d R (2014) SNAP: A general purpose network analysis and graph mining library in C++. http:\/\/snap.stanford.edu\/snap . Accessed 30 July 2017."},{"issue":"2","key":"54_CR45","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/comnet\/cnt009","volume":"1","author":"S Leyffer","year":"2013","unstructured":"Leyffer, S, Safro I (2013) Fast response to infection spread and cyber attacks on large-scale networks. J Complex Netw 1(2):183\u2013199.","journal-title":"J Complex Netw"},{"issue":"4","key":"54_CR46","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, Vahdat A (2006) Systematic topology analysis and generation using degree correlations. ACM SIGCOMM Comput Commun Rev 36(4):135\u2013146.","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"54_CR47","volume-title":"On the origin of power laws in internet topologies. Tech. rep","author":"A Medina","year":"2000","unstructured":"Medina, A, Matta I, Byers J (2000) On the origin of power laws in internet topologies. Tech. rep. Boston University, Boston, MA, USA."},{"key":"54_CR48","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H, N\u00f6llenburg M, Schulz C (2015) Drawing large graphs by multilevel maxent-stress optimization. In: Giacomo ED Lubiw A (eds)Graph, Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26 2015, Revised Selected, Papers, Lecture Notes in Computer Science, vol. 9411, 30\u201343.. Springer. doi: 10.1007\/978-3-319-27261-0_3 . http:\/\/dx.doi.org\/10.1007\/978-3-319-27261-0_3","DOI":"10.1007\/978-3-319-27261-0_3"},{"key":"54_CR49","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H, Sanders P, Schulz C (2016) Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. J Heuristics 22(5):759\u2013782. doi: 10.1007\/s10732-016-9315-8 . http:\/\/dx.doi.org\/10.1007\/s10732-016-9315-8","DOI":"10.1007\/s10732-016-9315-8"},{"issue":"1","key":"54_CR50","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jtbi.2004.07.026","volume":"232","author":"L Meyers","year":"2005","unstructured":"Meyers, L, Pourbohloul B, Newman M, Skowronski D, Brunham R (2005) Network theory and sars: predicting outbreak diversity. J Theor Biol 232(1):71\u201381.","journal-title":"J Theor Biol"},{"key":"54_CR51","unstructured":"Mihail, C, Zegura E (2003) The markov chain simulation method for generating connected power law random graphs In: Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, vol. 111, 16.. Society for Industrial Mathematics."},{"key":"54_CR52","unstructured":"Milo, R, Kashtan N, Itzkovitz S, Newman MEJ, Alon U (2003) On the uniform generation of random graphs with prescribed degree sequences. preprint arXiv:cond-mat\/0312028."},{"key":"54_CR53","doi-asserted-by":"crossref","unstructured":"Mones, E, Vicsek L, Vicsek T (2012) Hierarchy measure for complex networks. PLoS ONE 7(3):e33\u2013799. doi: 10.1371\/journal.pone.0033799 . http:\/\/dx.doi.org\/10.1371","DOI":"10.1371\/journal.pone.0033799"},{"key":"54_CR54","doi-asserted-by":"crossref","unstructured":"Newman, M (2010) Networks: an introduction. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199206650.003.0001"},{"key":"54_CR55","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167\u2013256.","journal-title":"SIAM Rev"},{"issue":"7043","key":"54_CR56","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818.","journal-title":"Nature"},{"issue":"17","key":"54_CR57","doi-asserted-by":"publisher","first-page":"7640","DOI":"10.1073\/pnas.0912983107","volume":"107","author":"G Palla","year":"2010","unstructured":"Palla, G, Lov\u00e1sz L, Vicsek T (2010) Multifractal network generator. Proc Natl Acad Sci 107(17):7640.","journal-title":"Proc Natl Acad Sci"},{"key":"54_CR58","doi-asserted-by":"crossref","unstructured":"Palmer, CR, Gibbons PB, Faloutsos C (2002) Anf: A fast and scalable tool for data mining in massive graphs In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 81\u201390.. ACM.","DOI":"10.1145\/775047.775059"},{"issue":"suppl 1","key":"54_CR59","doi-asserted-by":"publisher","first-page":"i159","DOI":"10.1136\/sti.78.suppl_1.i159","volume":"78","author":"JJ Potterat","year":"2002","unstructured":"Potterat, JJ, Phillips-Plummer L, Muth SQ, Rothenberg R, Woodhouse D, Maldonado-Long T, Zimmerman H, Muth J (2002) Risk network structure in the early epidemic phase of hiv transmission in colorado springs. Sexually Transmitted Infect 78(suppl 1):i159\u2013i163.","journal-title":"Sexually Transmitted Infect"},{"issue":"1","key":"54_CR60","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/100791142","volume":"9","author":"D Ron","year":"2011","unstructured":"Ron, D, Safro I, Brandt A (2011) Relaxation-based coarsening and multiscale graph organization. Multiscale Model Simul 9(1):407\u2013423.","journal-title":"Multiscale Model Simul"},{"issue":"1","key":"54_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-014-0242-0","volume":"5","author":"WE Schlauch","year":"2015","unstructured":"Schlauch, WE, Horv\u00e1t E\u00c1, Zweig KA (2015) Different flavors of randomness: comparing random graph models with fixed degree sequences. Soc Netw Anal Mining 5(1):1\u201314. doi: 10.1007\/s13278-015-0267-z .","journal-title":"Soc Netw Anal Mining"},{"key":"54_CR62","unstructured":"Seshadhri, C, Kolda TG, Pinar A (2011) Community structure and scale-free collections of Erd\u00f6s-Renyi graphs. http:\/\/arxiv.org\/abs\/1112.3644. Accessed 30 July 2017."},{"issue":"1","key":"54_CR63","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1111\/0081-1750.00099","volume":"31","author":"TA Snijders","year":"2001","unstructured":"Snijders, TA (2001) The statistical evaluation of social network dynamics. Sociol Methodol 31(1):361\u2013395.","journal-title":"Sociol Methodol"},{"key":"54_CR64","unstructured":"Staudt, CL (2016) Algorithms and software for the analysis of large complex networks. Ph.D. thesis. Karlsruhe Institute of Technology. doi: 10.5445\/IR\/1000056470 ."},{"key":"54_CR65","doi-asserted-by":"crossref","unstructured":"Staudt, CL, Hamann M, Safro I, Gutfraind A, Meyerhenke H (2016) Generating scaled replicas of real-world complex networks In: International Workshop on Complex Networks and their Applications, 17\u201328.. Springer.","DOI":"10.1007\/978-3-319-50901-3_2"},{"issue":"1","key":"54_CR66","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPDS.2015.2390633","volume":"27","author":"CL Staudt","year":"2016","unstructured":"Staudt, CL, Meyerhenke H (2016) Engineering parallel algorithms for community detection in massive networks. IEEE Trans Parallel Distributed Syst 27(1):171\u2013184.","journal-title":"IEEE Trans Parallel Distributed Syst"},{"issue":"4","key":"54_CR67","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"CL Staudt","year":"2016","unstructured":"Staudt, CL, Sazonovs A, Meyerhenke H (2016) NetworKit: A tool suite for large-scale complex network analysis. Netw Sci 4(4):508\u2013530.","journal-title":"Netw Sci"},{"issue":"1","key":"54_CR68","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-3615(03)00104-0","volume":"53","author":"S Terzi","year":"2004","unstructured":"Terzi, S, Cavalieri S (2004) Simulation in the supply chain context: a survey. Comput Ind 53(1):3\u201316.","journal-title":"Comput Ind"},{"issue":"16","key":"54_CR69","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud, AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Physica A: Stat Mech Appl 391(16):4165\u20134180.","journal-title":"Physica A: Stat Mech Appl"},{"key":"54_CR70","unstructured":"Trottenberg, U, Oosterlee C, Sch\u00fcller U (2001) Multigrid. Academic Press, Inc."},{"key":"54_CR71","unstructured":"Viger, F, Latapy M (2005) Random generation of large connected simple graphs with prescribed degree distribution In: 11th International Conference on Computing and Combinatorics.. Kunming."},{"key":"54_CR72","doi-asserted-by":"crossref","unstructured":"von Looz, M, Meyerhenke H, Prutkin R (2015) Generating random hyperbolic graphs in subquadratic time In: Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, 467\u2013478.. Springer.","DOI":"10.1007\/978-3-662-48971-0_40"},{"key":"54_CR73","doi-asserted-by":"crossref","unstructured":"Watts, DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393(6684):440\u20132. doi: 10.1038\/30918 .","DOI":"10.1038\/30918"},{"issue":"3","key":"54_CR74","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/cplx.20165","volume":"12","author":"D Wolpert","year":"2007","unstructured":"Wolpert, D, Macready W (2007) Using self-dissimilarity to quantify complexity. Complexity 12(3):77\u201385.","journal-title":"Complexity"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-017-0054-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-017-0054-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-017-0054-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T13:25:31Z","timestamp":1750944331000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-017-0054-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,13]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["54"],"URL":"https:\/\/doi.org\/10.1007\/s41109-017-0054-z","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2017,10,13]]},"assertion":[{"value":"6 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"No research involving human subjects, human material, or human data has been performed.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"36"}}