{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:24Z","timestamp":1725516264365},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788072"},{"type":"electronic","value":"9783540788089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78808-9_5","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"47-58","source":"Crossref","is-referenced-by-count":0,"title":["Local\/Global Phenomena in Geometrically Generated Graphs"],"prefix":"10.1007","author":[{"given":"Ross M.","family":"Richardson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Koutsoupias, E., Papadimitriou, C.: Heuristically optimized tradeoffs: A new paradigm for powerlaws in the internet. In: Proc. of 29th International Colloquium of Automata, Languages, and Programming (2002)","DOI":"10.1007\/3-540-45465-9_11"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Chung, F.: The diameter of a cycle plus a random matching. SIAM J. on Discrete Math, 328\u2013333 (1988)","DOI":"10.1137\/0401033"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"issue":"33","key":"5_CR4","doi-asserted-by":"publisher","first-page":"11623","DOI":"10.1073\/pnas.0503018102","volume":"102","author":"D. Liben-Nowell","year":"2005","unstructured":"Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. Proceedings of the National Academy of Sciences\u00a0102(33), 11623\u201311628 (2005)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lu, L.: Modeling the small-world phenomena with local network flow. Internet Mathematics, 359\u2013385 (2006)","DOI":"10.1080\/15427951.2005.10129109"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: Complex Graphs and Networks. CBMS Lecture Notes. AMS (2006)","DOI":"10.1090\/cbms\/107"},{"key":"5_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-89613-1","volume-title":"The Internet Galaxy: Reflections on the Internet, Business, and Society","author":"M. Castells","year":"2001","unstructured":"Castells, M.: The Internet Galaxy: Reflections on the Internet, Business, and Society. Oxford U. Press, New York (2001)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Berger, N., Bollob\u00e1s, B., Borgs, C., Chayes, J., Riordan, O.:Degree distribution of the FKP network model. In: Proc. of the 30th International Colloquium of Automata, Languages and Programming, pp. 725\u2013738 (2003)","DOI":"10.1007\/3-540-45061-0_57"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Geometric Random Graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Geometric Random Graphs. Oxford U. Press, New York (2003)"},{"key":"5_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511895357","volume-title":"Continuum Percolation","author":"R. Meester","year":"1996","unstructured":"Meester, R., Roy, R.: Continuum Percolation. Cambridge U. Press, New York (1996)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Flaxman, A., Frieze, A., Vera, J.: Geometric preferential attachment model of networks. In: Proc. 3rd International Workshop on Algorithms and Models for the Web-Graph, pp. 44\u201355 (2004)","DOI":"10.1007\/978-3-540-30216-2_4"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Chung, F., Jungreis, D., Handjani, S.: Generalizations of P\u00f3lya\u2019s urn problem. Ann. of Comb, 141\u2013153 (2003)","DOI":"10.1007\/s00026-003-0178-y"},{"key":"5_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. John Wiley & Sons Inc, Chichester (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78808-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:15:36Z","timestamp":1606184136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78808-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788072","9783540788089"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78808-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}