{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:46:48Z","timestamp":1742932008145,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540959946"},{"type":"electronic","value":"9783540959953"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95995-3_8","type":"book-chapter","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T02:33:44Z","timestamp":1233196424000},"page":"90-103","source":"Crossref","is-referenced-by-count":4,"title":["Characterization of Tail Dependence for In-Degree and PageRank"],"prefix":"10.1007","author":[{"given":"Nelly","family":"Litvak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Scheinhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yana","family":"Volkovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bert","family":"Zwart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","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.\u00a038(1), 2 (2006)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1080\/15427951.2004.10129088","volume":"1","author":"M. Mitzenmacher","year":"2004","unstructured":"Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Math.\u00a01(2), 226\u2013251 (2004)","journal-title":"Internet Math."},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev.\u00a045(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1140\/epjb\/e2004-00056-6","volume":"38","author":"D. Donato","year":"2004","unstructured":"Donato, D., Laura, L., Leonardi, S., Millozi, S.: Large scale properties of the Webgraph. Eur. Phys. J.\u00a038, 239\u2013243 (2004)","journal-title":"Eur. Phys. J."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-45655-4_36","volume-title":"Computing and Combinatorics","author":"G. Pandurangan","year":"2002","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to characterize Web structure. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, p. 330. Springer, Heidelberg (2002)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-77004-6_9","volume-title":"Algorithms and Models for the Web-Graph","author":"Y. Volkovich","year":"2007","unstructured":"Volkovich, Y., Litvak, N., Donato, D.: Determining factors behind the PageRank log-log plot. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol.\u00a04863, pp. 108\u2013123. Springer, Heidelberg (2007)"},{"key":"8_CR7","first-page":"107","volume":"33","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Networks\u00a033, 107\u2013117 (1998)","journal-title":"Comput. Networks"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-78808-9_6","volume-title":"Algorithms and Models for the Web-Graph","author":"S. Fortunato","year":"2008","unstructured":"Fortunato, S., Bogu\u00f1\u00e1, M., Flammini, A., Menczer, F.: Approximating PageRank from in-degree. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol.\u00a04936, pp. 59\u201371. Springer, Heidelberg (2008)"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/0470012382","volume-title":"Statistics of Extremes: Theory and Applications","author":"J. Beirlant","year":"2004","unstructured":"Beirlant, J., Goegebeur, Y., Segers, J., Teugels, J.: Statistics of Extremes: Theory and Applications. Wiley, Chichester (2004)"},{"key":"8_CR10","volume-title":"Heavy-tail Phenomena","author":"S.I. Resnick","year":"2007","unstructured":"Resnick, S.I.: Heavy-tail Phenomena. Springer, New York (2007)"},{"key":"8_CR11","first-page":"1113","volume-title":"WWW 2008: Proceedings of the 17th international conference on World Wide Web","author":"Y. Volkovich","year":"2008","unstructured":"Volkovich, Y., Litvak, N., Zwart, B.: Measuring extremal dependencies in Web graphs. In: WWW 2008: Proceedings of the 17th international conference on World Wide Web, pp. 1113\u20131114. ACM Press, New York (2008)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Volkovich, Y., Litvak, N., Zwart, B.: A framework for evaluating statistical dependencies and rank correlations in power law graphs. Memorandum 1868, Enschede (2008)","DOI":"10.1007\/978-3-642-02469-6_43"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-78808-9_7","volume-title":"Algorithms and Models for the Web-Graph","author":"N. Litvak","year":"2008","unstructured":"Litvak, N., Scheinhardt, W.R.W., Volkovich, Y.: Probabilistic relation between in-degree and PageRank. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol.\u00a04936, pp. 72\u201383. Springer, Heidelberg (2008)"},{"key":"8_CR14","unstructured":"Volkovich, Y., Litvak, N.: Asymptotic analysis for personalized Web search. Memorandum 1884, Enschede (2008)"},{"key":"8_CR15","unstructured":"Jessen, A.H., Mikosch, T.: Regularly varying functions. Publications de l\u2019institut mathematique, Nouvelle s\u00e9rie\u00a079(93) (2006)"},{"key":"8_CR16","first-page":"595","volume-title":"WWW 2004: Proceedings of the 13th International Conference on World Wide Web","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: WWW 2004: Proceedings of the 13th International Conference on World Wide Web, pp. 595\u2013601. ACM Press, New York (2004)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"R. Albert","year":"1999","unstructured":"Albert, R., Barab\u00e1si, A.L.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/15427951.2006.10129120","volume":"3","author":"K. Avrachenkov","year":"2006","unstructured":"Avrachenkov, K., Lebedev, D.: PageRank of scale-free growing networks. Internet Math.\u00a03(2), 207\u2013231 (2006)","journal-title":"Internet Math."},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1002\/rsa.20063","volume":"27","author":"R. Hofstad van der","year":"2005","unstructured":"van der Hofstad, R., Hooghiemstra, G., van Mieghem, P.: Distances in random graphs with finite variance degrees. Random Structures Algorithms\u00a027(1), 76\u2013123 (2005)","journal-title":"Random Structures Algorithms"},{"issue":"25","key":"8_CR20","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1214\/EJP.v12-420","volume":"12","author":"R. Hofstad van der","year":"2007","unstructured":"van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with finite mean and infinite variance degrees. Electron. J. Probab.\u00a012(25), 703\u2013766 (2007)","journal-title":"Electron. J. Probab."}],"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-540-95995-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:24:07Z","timestamp":1558095847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95995-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540959946","9783540959953"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95995-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}