{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:59:21Z","timestamp":1772297961299,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319509006","type":"print"},{"value":"9783319509013","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50901-3_2","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:02:04Z","timestamp":1480464124000},"page":"17-28","source":"Crossref","is-referenced-by-count":11,"title":["Generating Scaled Replicas of Real-World Complex Networks"],"prefix":"10.1007","author":[{"given":"Christian L.","family":"Staudt","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hamann","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gutfraind","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 171\u2013180. Acm (2000)","DOI":"10.1145\/335305.335326"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Albert, R., Barab\u00e1si, A.: Statistical mechanics of complex networks. Reviews of modern physics 74(1), 47 (2002)","DOI":"10.1103\/RevModPhys.74.47"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"An, W.: Fitting ERGMs on big networks. Social Science Research 59, 107 \u2013 119 (2016). Special issue on Big Data in the Social Sciences","DOI":"10.1016\/j.ssresearch.2016.04.019"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: Structure and dynamics. Physics reports 424(4), 175\u2013308 (2006)","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Caldarelli, G., Vespignani, A.: Large scale structure and dynamics of complex networks. World Scientific (2007)","DOI":"10.1142\/6455"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: Proc. 4th SIAM Intl. Conf. on Data Mining (SDM). SIAM, Orlando, FL (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. Computer Science Department p. 541 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM review 51(4), 661\u2013703 (2009)","DOI":"10.1137\/070710111"},{"key":"2_CR9","unstructured":"Dasari, N.S., Ranjan, D., Zubair, M.: 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, pp. 9\u201316. IEEE (2014)"},{"key":"2_CR10","unstructured":"Fortunato, S.: Benchmark graphs to test community detection algorithms. URL https: \/\/sites.google.com\/site\/santofortunato\/inthepress2"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: ALENEX, pp. 90\u2013100. SIAM (2008)","DOI":"10.1137\/1.9781611972887.9"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Foundations and TrendsR in Machine Learning 2(2), 129\u2013233 (2010)","DOI":"10.1561\/2200000005"},{"key":"2_CR13","unstructured":"Gutfraind, A., Meyers, L., Safro, I.: Musketeer: Multiscale entropic network generator. URL https:\/\/people.cs.clemson.edu\/\u02dcisafro\/musketeer\/index.html"},{"key":"2_CR14","unstructured":"Gutfraind, A., Safro, I., Meyers, L.A.: Multiscale network generation. In: 18th International Conference on Information Fusion, FUSION 2015, Washington, DC, USA, July 6-9, 2015, pp. 158\u2013165 (2015)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Hamann, M., Lindner, G., Meyerhenke, H., Staudt, C.L., Wagner, D.: Structure-preserving sparsification methods for social networks. Social Netw. Analys. Mining 6(1), 22:1\u201322:22 (2016)","DOI":"10.1007\/s13278-016-0332-2"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C.: A scalable generative graph model with community structure. arXiv preprint arXiv:1302.6636 (2013)","DOI":"10.1137\/130914218"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogu\u00f1\u00e1, M.: Hyperbolic geometry of complex networks. Physical Review E 82, 036,106 (2010)","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E 80(1), 016,118 (2009)","DOI":"10.1103\/PhysRevE.80.016118"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review E 78(4), 046,110 (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using kronecker multiplication. In: Proc. 24th Intl. Conference on Machine learning, pp. 497\u2013504. ACM (2007)","DOI":"10.1145\/1273496.1273559"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"von Looz, M., Meyerhenke, H., Prutkin, R.: Generating random hyperbolic graphs in subquadratic time. In: Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, pp. 467\u2013478 (2015)","DOI":"10.1007\/978-3-662-48971-0_40"},{"key":"2_CR22","unstructured":"Milo, R., Kashtan, N., Itzkovitz, S., Newman, M.E.J., Alon, U.: On the uniform generation of random graphs with prescribed degree sequences. eprint arXiv:cond-mat\/0312028 (2003)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Newman, M.: Networks: an introduction. Oxford University Press (2010)","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"2_CR24","unstructured":"P. Erd\u0151s, A.R.: On the Evolution of Random Graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences (1960)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Robins, G., Pattison, P., Kalish, Y., Lusher, D.: An introduction to exponential random graph (p*) models for social networks. Social Networks 29(2), 173 \u2013 191 (2007). Special Section: Advances in Exponential Random Graph (p*) Models","DOI":"10.1016\/j.socnet.2006.08.002"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Schlauch, W.E., Horv\u00e1t, E.\u00c1 ., Zweig, K.A.: Different flavors of randomness: comparing random graph models with fixed degree sequences. Social Network Analysis and Mining 5(1), 1\u201314 (2015). DOI 10.1007\/s13278-015-0267-z","DOI":"10.1007\/s13278-015-0267-z"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Snijders, T.A.: The statistical evaluation of social network dynamics. Sociological methodology 31(1), 361\u2013395 (2001)","DOI":"10.1111\/0081-1750.00099"},{"key":"2_CR28","unstructured":"Staudt, C., Hamann, M., Safro, I., Gutfraind, A., Meyerhenke, H.: Generating Scaled Replicas of Real-World Complex Networks. Tech. rep., arXiv (2016). URL http:\/\/arxiv.org\/abs\/1609.02121. ArXiv:1609.02121"},{"key":"2_CR29","unstructured":"Staudt, C.L.: Algorithms and software for the analysis of large complex networks. Ph.D. thesis, Karlsruhe Institute of Technology (2016). DOI 10.5445\/IR\/1000056470"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Staudt, C.L., Meyerhenke, H.: Engineering parallel algorithms for community detection in massive networks. IEEE Trans. on Parallel and Distributed Systems 27(1), 171\u2013184 (2016)","DOI":"10.1109\/TPDS.2015.2390633"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: NetworKit: A tool suite for large-scale network analysis. Network Science To appear","DOI":"10.1017\/nws.2016.20"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Traud, A.L., Mucha, P.J., Porter, M.A.: Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications 391(16), 4165\u20134180 (2012)","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"2_CR33","unstructured":"Viger, F., Latapy, M.: Random generation of large connected simple graphs with prescribed degree distribution. In: 11th International Conference on Computing and Combinatorics. Kunming, Yunnan, Chine (2005)"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50901-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T22:55:25Z","timestamp":1568588125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50901-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,30]]},"ISBN":["9783319509006","9783319509013"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50901-3_2","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,30]]}}}