{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:42Z","timestamp":1759638462520,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_40","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"467-478","source":"Crossref","is-referenced-by-count":21,"title":["Generating Random Hyperbolic Graphs in Subquadratic Time"],"prefix":"10.1007","author":[{"given":"Moritz","family":"von Looz","sequence":"first","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 171\u2013180. ACM (2000)","DOI":"10.1145\/335305.335326"},{"issue":"1","key":"40_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.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"40_CR3","doi-asserted-by":"publisher","unstructured":"Aldecoa, R., Orsini, C., Krioukov, D.: Hyperbolic graph generator. Comput. Phys. Commun. 196, 492\u2013496 (2015). doi: 10.1016\/j.cpc.2015.05.028 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0010465515002088","DOI":"10.1016\/j.cpc.2015.05.028"},{"key":"40_CR4","series-title":"Springer Undergraduate Mathematics Series","volume-title":"Hyperbolic Geometry","author":"JW Anderson","year":"2005","unstructured":"Anderson, J.W.: Hyperbolic Geometry. Springer Undergraduate Mathematics Series, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"40_CR5","unstructured":"Bader, D.A., Berry, J., Kahan, S., Murphy, R., Riedy, E.J., Willcock, J.: Graph 500 benchmark 1 (\u201csearch\u201d), version 1.1. Technical report, Graph 500 (2010)"},{"issue":"3","key":"40_CR6","doi-asserted-by":"publisher","first-page":"036113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)","journal-title":"Phys. Rev. E"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Bode, M., Fountoulakis, N., M\u00fcller, T.: On the giant component of random hyperbolic graphs. In: The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol. 16, pp. 425\u2013429. Scuola Normale Superiore (2013)","DOI":"10.1007\/978-88-7642-475-5_68"},{"key":"40_CR8","unstructured":"Bode, M., Fountoulakis, N., M\u00fcller, T.: The probability that the hyperbolic random graph is connected (2014). http:\/\/web.mat.bham.ac.uk\/N.Fountoulakis\/BFM.pdf . Preprint"},{"issue":"1","key":"40_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv. (CSUR) 38(1), 2 (2006)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In Proceedings of the 4th SIAM International Conference on Data Mining (SDM), Orlando, FL. SIAM, April 2004","DOI":"10.1137\/1.9781611972740.43"},{"key":"40_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198515906.001.0001","volume-title":"Evolution of Networks: from Biological Nets to the Internet and WWW","author":"SN Dorogovtsev","year":"2003","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: from Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003)"},{"key":"40_CR12","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, Part II. LNCS, vol. 7392, pp. 573\u2013585. Springer, Heidelberg (2012)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Kiwi, M., Mitsche, D.: A bound for the diameter of random hyperbolic graphs. In: 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 26\u201339. SIAM, January 2015","DOI":"10.1137\/1.9781611973761.3"},{"issue":"5","key":"40_CR14","doi-asserted-by":"publisher","first-page":"C424","DOI":"10.1137\/130914218","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Todd, P., Seshadhri, C.: A scalable generative graph model with community structure. SIAM J. Sci. Comput. 36(5), C424\u2013C452 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"40_CR15","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"},{"issue":"4","key":"40_CR16","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-21286-4_10","volume-title":"Algorithms and Models for the Web Graph","author":"JC Miller","year":"2011","unstructured":"Miller, J.C., Hagberg, A.: Efficient generation of networks with given expected degrees. In: Frieze, A., Horn, P., Pra\u0142at, P. (eds.) WAW 2011. LNCS, vol. 6732, pp. 115\u2013126. Springer, Heidelberg (2011)"},{"key":"40_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"40_CR19","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2005","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco (2005)"},{"issue":"5","key":"40_CR20","doi-asserted-by":"publisher","first-page":"056109","DOI":"10.1103\/PhysRevE.85.056109","volume":"85","author":"C Seshadhri","year":"2012","unstructured":"Seshadhri, C., Kolda, T.G., Pinar, A.: Community structure and scale-free collections of Erd\u0151s-R\u00e9nyi graphs. Phys. Rev. E 85(5), 056109 (2012)","journal-title":"Phys. Rev. E"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: The similarity between stochastic Kronecker and Chung-Lu graph models. In: Proceedings of the 2012 SIAM International Conference on Data Mining (SDM), pp. 1071\u20131082 (2012)","DOI":"10.1137\/1.9781611972825.92"},{"key":"40_CR22","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: NetworKit: an interactive tool suite for high-performance network analysis (2014). arXiv preprint arXiv:1403.3005"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"von Looz, M., Meyerhenke, H.: Querying probabilistic neighborhoods in spatial data sets efficiently, September 2015. ArXiv preprint arXiv:1509.01990","DOI":"10.1007\/978-3-319-44543-4_35"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"von Looz, M., Meyerhenke, H., Prutkin, R.: Generating random hyperbolic graphs in subquadratic time, September 2015. ArXiv preprint arXiv:1501.03545","DOI":"10.1007\/978-3-662-48971-0_40"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:12:05Z","timestamp":1748704325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}