{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:03Z","timestamp":1759637643853,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_49","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"614-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the Diameter of Hyperbolic Random Graphs"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Krohmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Bode, M., Fountoulakis, N., M\u00fcller, T.: On the giant component of random hyperbolic graphs. In: 7th European Conference on Combinatorics, Graph Theory and Applications (EuroComb), pp. 425\u2013429 (2013)","DOI":"10.1007\/978-88-7642-475-5_68"},{"key":"49_CR3","unstructured":"Bode, M., Fountoulakis, N., M\u00fcller, T.: The probability that the hyperbolic random graph is connected (2014). www.math.uu.nl\/ Muell001\/Papers\/BFM.pdf"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1038\/ncomms1063","volume":"1","author":"M Bogun\u00e1","year":"2010","unstructured":"Bogun\u00e1, M., Papadopoulos, F., Krioukov, D.: Sustaining the internet with hyperbolic mapping. Nature Communications 1, 62 (2010)","journal-title":"Nature Communications"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random graphs. Springer (1998)","DOI":"10.1007\/978-1-4612-0619-4_7"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0401033","volume":"1","author":"B Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B., Chung, F.R.K.: The diameter of a cycle plus a random matching. SIAM Journal of Discrete Mathematics 1, 328\u2013333 (1988)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"49_CR7","unstructured":"Candellero, E., Fountoulakis, N.: Bootstrap percolation and the geometry of complex networks (2014). arxiv1412.1301"},{"key":"49_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. Proceedings of the National Academy of Sciences 99, 15879\u201315882 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"49_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-15844-5_18","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"B Doerr","year":"2010","unstructured":"Doerr, B., Goldberg, L.A.: Drift analysis with tail bounds. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 174\u2013183. Springer, Heidelberg (2010)"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s10955-010-9921-z","volume":"139","author":"S Dommers","year":"2010","unstructured":"Dommers, S., van der Hofstad, R., Hooghiemstra, G.: Diameters in preferential attachment models. Journal of Statistical Physics 139, 72\u2013107 (2010)","journal-title":"Journal of Statistical Physics"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of measure for the analysis of randomized algorithms. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"49_CR12","unstructured":"Evans, M., Hastings, N., Peacock, B.: Statistical Distributions, chapter 12, 3rd edn., pp. 71\u201373. Wiley-Interscience (2000)"},{"key":"49_CR13","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in models of real-world networks (2015). Unpublished draft"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Krohmer, A.: Cliques in hyperbolic random graphs. In: 34th IEEE Conference on Computer Communications (INFOCOM) (2015). https:\/\/hpi.de\/fileadmin\/user_upload\/fachgebiete\/friedrich\/publications\/2015\/cliques2015.pdf","DOI":"10.1109\/INFOCOM.2015.7218533"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00453-012-9710-y","volume":"67","author":"T Friedrich","year":"2013","unstructured":"Friedrich, T., Sauerwald, T., Stauffer, A.: Diameter and broadcast time of random geometric graphs in arbitrary dimensions. Algorithmica 67, 65\u201388 (2013)","journal-title":"Algorithmica"},{"key":"49_CR16","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":"49_CR17","doi-asserted-by":"crossref","unstructured":"Kiwi, M., Mitsche, D.: A bound for the diameter of random hyperbolic graphs. In: 12th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 26\u201339 (2015)","DOI":"10.1137\/1.9781611973761.3"},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"J Kleinberg","year":"2000","unstructured":"Kleinberg, J.: Navigation in a small world. Nature 406, 845 (2000)","journal-title":"Nature"},{"key":"49_CR19","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. Physical Review E 82, 036106 (2010)","journal-title":"Physical Review E"},{"key":"49_CR20","unstructured":"Lehre, P.K., Witt, C.: General drift analysis with tail bounds (2013). arxiv1307.2559"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Martel, C.U., Nguyen, V.: Analyzing Kleinberg\u2019s (and other) small-world models. In: 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 179\u2013188 (2004)","DOI":"10.1145\/1011767.1011794"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Papadopoulos, F., Psomas, C., Krioukov, D.: Network mapping by replaying hyperbolic growth. IEEE\/ACM Transactions on Networking, 198\u2013211 (2014)","DOI":"10.1109\/TNET.2013.2294052"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford scholarship online. Oxford University Press (2003)","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"49_CR24","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S0963548310000325","volume":"19","author":"O Riordan","year":"2010","unstructured":"Riordan, O., Wormald, N.: The diameter of sparse random graphs. Combinatorics, Probability and Computing 19, 835\u2013926 (2010)","journal-title":"Combinatorics, Probability and Computing"},{"key":"49_CR25","unstructured":"von Looz, M., Staudt, C.L., Meyerhenke, H., Prutkin, R.: Fast generation of dynamic complex networks with underlying hyperbolic geometry (2015). arxiv1501.03545"},{"key":"49_CR26","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 \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:03:34Z","timestamp":1748459014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}