{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:02:49Z","timestamp":1761663769159},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319928708"},{"type":"electronic","value":"9783319928715"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92871-5_8","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:51:15Z","timestamp":1527587475000},"page":"99-114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards a Systematic Evaluation of Generative Network Models"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Katzmann","sequence":"additional","affiliation":[]},{"given":"Anton","family":"Krohmer","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Striebel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1063\/1.4997921","volume":"27","author":"N Attar","year":"2017","unstructured":"Attar, N., Aliakbary, S.: Classification of complex networks based on similarity of topological network features. Chaos 27(9), 1\u20137 (2017)","journal-title":"Chaos"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1093\/bioinformatics\/16.5.412","volume":"16","author":"P Baldi","year":"2000","unstructured":"Baldi, P., Brunak, S., Chauvin, Y., Andersen, C.A.F., Nielsen, H.: Assessing the accuracy of prediction algorithms for classification: an overview. Bioinformatics 16(5), 412\u2013424 (2000)","journal-title":"Bioinformatics"},{"issue":"5439","key":"8_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, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/380995.380999","volume":"2","author":"KP Bennett","year":"2000","unstructured":"Bennett, K.P., Campbell, C.: Support vector machines: hype or hallelujah? SIGKDD Explor. 2(2), 1\u201313 (2000)","journal-title":"SIGKDD Explor."},{"unstructured":"Bl\u00e4sius, T., Friedrich, T., Krohmer, A., Laue, S.: Efficient embedding of scale-free graphs in the hyperbolic plane. In: 24th ESA, pp. 16:1\u201316:18 (2016)","key":"8_CR5"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5\u201334 (2004)","journal-title":"Combinatorica"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Struct. Algor. 18(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algor."},{"issue":"25","key":"8_CR8","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. 99(25), 15879\u201315882 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125\u2013145 (2002)","journal-title":"Ann. Comb."},{"doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: The small-world phenomenon. In: Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Chap. 20, pp. 611\u2013644. Cambridge University Press (2010)","key":"8_CR10","DOI":"10.1017\/CBO9780511761942.021"},{"issue":"10","key":"8_CR11","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.dam.2011.02.003","volume":"159","author":"N Eggemann","year":"2011","unstructured":"Eggemann, N., Noble, S.D.: The clustering coefficient of a scale-free random graph. Discrete Appl. Math. 159(10), 953\u2013965 (2011)","journal-title":"Discrete Appl. Math."},{"key":"8_CR12","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. 6, 290\u2013297 (1959)","journal-title":"Publ. Math."},{"key":"8_CR13","first-page":"3133","volume":"15","author":"M Fern\u00e1ndez-Delgado","year":"2014","unstructured":"Fern\u00e1ndez-Delgado, M., Cernadas, E., Barro, S., Amorim, D., Amorim Fern\u00e1ndez-Delgado, D.: Do we need hundreds of classifiers to solve real world classification problems? J. Mach. Learn. Res. 15, 3133\u20133181 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/978-3-662-47666-6_49","volume-title":"Automata, Languages, and Programming","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., Krohmer, A.: On the diameter of hyperbolic random graphs. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 614\u2013625. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_49"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-642-31585-5_51","volume-title":"Automata, Languages, and Programming","author":"L Gugelmann","year":"2012","unstructured":"Gugelmann, L., Panagiotou, K., Peter, U.: Random hyperbolic graphs: degree sequence and clustering. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 573\u2013585. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_51"},{"unstructured":"Karp, R.M.: The probabilistic analysis of combinatorial optimization algorithms. In: Proceedings of the International Congress of Mathematicians, pp. 1601\u20131609 (1983)","key":"8_CR16"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"036106","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.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015). http:\/\/networkrepository.com","key":"8_CR18","DOI":"10.1609\/aaai.v29i1.9277"},{"volume-title":"Advances in Kernel Methods: Support Vector Learning","year":"1999","unstructured":"Sch\u00f6lkopf, B., Burges, C.J.C., Smola, A.J. (eds.): Advances in Kernel Methods: Support Vector Learning. MIT Press, Cambridge (1999)","key":"8_CR19"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1137\/1.9781611973440.118","volume-title":"Proceedings of the 2014 SIAM International Conference on Data Mining","author":"Sucheta Soundarajan","year":"2014","unstructured":"Soundarajan, S., Eliassi-Rad, T., Gallagher, B.: A guide to selecting a network similarity method. In: SDM, pp. 1037\u20131045 (2014)"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"CL Staudt","year":"2016","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: NetworKit: a tool suite for large-scale complex network analysis. Netw. Sci. 4(4), 508\u2013530 (2016)","journal-title":"Netw. Sci."},{"issue":"9","key":"8_CR22","doi-asserted-by":"publisher","first-page":"5766","DOI":"10.1073\/pnas.082090499","volume":"99","author":"DJ Watts","year":"2002","unstructured":"Watts, D.J.: A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. 99(9), 5766\u20135771 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u201csmall-world\u201d networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92871-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T14:02:32Z","timestamp":1661349752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92871-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319928708","9783319928715"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92871-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}