{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T15:11:34Z","timestamp":1716649894544},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,28]],"date-time":"2015-07-28T00:00:00Z","timestamp":1438041600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00453-015-0034-6","type":"journal-article","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T10:37:52Z","timestamp":1437993472000},"page":"344-380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["It\u2019s a Small World for Random Surfers"],"prefix":"10.1007","volume":"76","author":[{"given":"Abbas","family":"Mehrabian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Wormald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"5439","key":"34_CR1","doi-asserted-by":"crossref","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(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"34_CR2","unstructured":"Bhamidi, S.: Universal techniques to analyze preferential attachment trees: global and local analysis. (2007). (preprint) http:\/\/www.unc.edu\/~bhamidi\/"},{"issue":"4","key":"34_CR3","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1209\/epl\/i2001-00260-6","volume":"54","author":"G Bianconi","year":"2001","unstructured":"Bianconi, G., Barab\u00e1si, A.-L.: Competition and multiscaling in evolving networks. Europhys. Lett. 54(4), 436\u2013442 (2001)","journal-title":"Europhys. Lett."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Chan, T.-H.H., Rwebangira, M.R.: A random-surfer web-graph model. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithmics and Combinatorics, ALENEX\/ANALCO \u201906, pp. 238\u2013246 (2006)","DOI":"10.1137\/1.9781611972962.8"},{"issue":"1","key":"34_CR5","doi-asserted-by":"crossref","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"},{"key":"34_CR6","first-page":"1456","volume-title":"Handbook of Graph Theory, Chapter 12.1","author":"A Bonato","year":"2013","unstructured":"Bonato, A., Chung, F.: Complex networks. In: Gross, J.L., Yellen, J., Zhang, P. (eds.) Handbook of Graph Theory, Chapter 12.1, 2nd edn, pp. 1456\u20131476. Chapman & Hall, London (2013)","edition":"2"},{"issue":"3\u20134","key":"34_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s00453-006-0112-x","volume":"46","author":"N Broutin","year":"2006","unstructured":"Broutin, N., Devroye, L.: Large deviations for the weighted height of an extended class of trees. Algorithmica 46(3\u20134), 271\u2013297 (2006)","journal-title":"Algorithmica"},{"key":"34_CR8","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv. 38(1), (2006). Article 2"},{"key":"34_CR9","unstructured":"Chebolu, P., Melsted, P.: Pagerank and the random surfer model. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201908, pp. 1010\u20131018. Philadelphia, PA, USA (2008)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Dembo, A., Zeitouni, O.: Large Deviations Techniques and Applications, Volume\u00a038 of Stochastic Modelling and Applied Probability. Springer, Berlin (2010). Corrected reprint of the second (1998) edition","DOI":"10.1007\/978-3-642-03311-7"},{"issue":"1","key":"34_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/rsa.20391","volume":"41","author":"L Devroye","year":"2012","unstructured":"Devroye, L., Fawzi, O., Fraiman, N.: Depth properties of scaled attachment random recursive trees. Random Struct. Algorithms 41(1), 66\u201398 (2012)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"34_CR12","doi-asserted-by":"crossref","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. J. Stat. Phys. 139(1), 72\u2013107 (2010)","journal-title":"J. Stat. Phys."},{"key":"34_CR13","unstructured":"Drinea, E., Frieze, A., Mitzenmacher, M.: Balls and bins models with feedback. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201902, pp. 308\u2013315. Philadelphia, PA, USA (2002)"},{"issue":"1\u20132","key":"34_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0378-4371(01)00408-3","volume":"303","author":"G Erg\u00fcn","year":"2002","unstructured":"Erg\u00fcn, G., Rodgers, G.J.: Growing random networks with fitness. Phys. A Stat. Mech. Appl. 303(1\u20132), 261\u2013272 (2002)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"066123","DOI":"10.1103\/PhysRevE.63.066123","volume":"63","author":"PL Krapivsky","year":"2001","unstructured":"Krapivsky, P.L., Redner, S.: Organization of growing random networks. Phys. Rev. E 63, 066123 (2001)","journal-title":"Phys. Rev. E"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data (TKDD) 1(1), (2007). Article 2","DOI":"10.1145\/1217299.1217301"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Using pagerank to characterize web structure. Internet Math. 3(1), 1\u201320 (2006). Conference version in COCOON 2002","DOI":"10.1080\/15427951.2006.10129114"},{"issue":"2","key":"34_CR18","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B Pittel","year":"1994","unstructured":"Pittel, B.: Note on the heights of random recursive trees and random $$m$$ m -ary search trees. Random Struct. Algorithms 5(2), 337\u2013347 (1994)","journal-title":"Random Struct. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0034-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0034-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0034-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T15:43:56Z","timestamp":1567007036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0034-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,28]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["34"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0034-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,28]]}}}