{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T08:49:59Z","timestamp":1775292599154,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030054106","type":"print"},{"value":"9783030054113","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T00:00:00Z","timestamp":1543708800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05411-3_9","type":"book-chapter","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T15:37:22Z","timestamp":1543678642000},"page":"104-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Delusive PageRank in Incomplete Graphs"],"prefix":"10.1007","author":[{"given":"Helge","family":"Holzmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avishek","family":"Anand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Megha","family":"Khosla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ainsworth, S.G., Alsum, A., SalahEldeen, H., Weigle, M.C., Nelson, M.L.: How much of the web is archived? In: Proceeding ACM\/IEEE- JCDL 2011","DOI":"10.1145\/1998076.1998100"},{"key":"9_CR2","unstructured":"Archiveteam. Friendster Social Network Dataset: Friends, : published under, vol. CC0, p. 1.0. Universal (2011)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., Vigna, S.: Do your worst to make the best: paradoxical effects in pagerank incremental computations. In: WAW (2004)","DOI":"10.1007\/978-3-540-30216-2_14"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595\u2013601. ACM Press, USA (2004)","DOI":"10.1145\/988672.988752"},{"key":"9_CR5","unstructured":"Bollob\u00e1s, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2003 (2003)"},{"issue":"3","key":"9_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s00799-016-0171-9","volume":"18","author":"M Costa","year":"2016","unstructured":"Costa, M., Gomes, D., Silva, M.J.: The evolution of web archiving. Int. J. Digit. Libr. 18(3), 191\u2013205 (2016)","journal-title":"Int. J. Digit. Libr."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., Sarlos, T.: On estimating the average degree. In: Proceedings of conference on World wide web, pp. 795\u2013806. ACM (2014)","DOI":"10.1145\/2566486.2568019"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publ. Math. Debr. 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debr."},{"issue":"4","key":"9_CR9","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: SciPy2008 (2008)","DOI":"10.25080\/TCWV9851"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank. In: Proceedings of the 11th international conference on WorldWide Web, pp. 517\u2013526. ACM (2002)","DOI":"10.1145\/511446.511513"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Holzmann, H., Nejdl, W., Anand, A.: Exploring web archives through temporal anchor texts. In: Proceedings of ACM Web Science Conference - WebSci 2017 (2017)","DOI":"10.1145\/3091478.3091500"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Holzmann, H., Nejdl, W., Anand, A.: The dawn of today\u2019s popular domains: a study of the archived german web over 18 years. In: Digital Libraries (JCDL) (2016)","DOI":"10.1145\/2910896.2910901"},{"key":"9_CR14","unstructured":"H\u00fcbler, C., Kriegel, H.-P., Borgwardt, K., Ghahramani, Z.: Metropolis algorithms for representative subgraph sampling. In: Eighth IEEE International Conference on Data Mining, 2008. ICDM 2008, pp. 283\u2013292. IEEE (2008)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Huurdeman, H.C., Ben-David, A., Kamps, J., Samar, T., de Vries, A.P.: Finding pages on the unarchived web. In: IEEE\/ACM JCDL (2014)","DOI":"10.1109\/JCDL.2014.6970188"},{"issue":"1\/2","key":"9_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"Maurice G Kendall","year":"1938","unstructured":"Kendall, Maurice G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"},{"key":"9_CR17","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1) (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"9_CR19","unstructured":"Li, R.-H., Yu, J.X., Qin, L., Mao, R., Jin, T.: On random walk based graph sampling. In: Data Engineering (ICDE), 2015 (2015)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Benefits of bias: towards better characterization of networksampling. In: Proceedings of the 17th ACM SIGKDD International Conferenceon Knowledge Discovery and Data Mining, pp. 105\u2013113. ACM (2011)","DOI":"10.1145\/2020408.2020431"},{"key":"9_CR21","unstructured":"Ng, A.Y., Zheng, A.X., Jordan, M.I.: Link analysis, eigenvectors and stability. In: Proceedings of International Joint Conference on Artificial Intelligence (2001)"},{"key":"9_CR22","unstructured":"Lawrence, P., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Smith, J.A., Moody, J.: Structural effects of network sampling coverage I: Nodes missing at random. In: Social Networks, vol. 35, pp. 652\u2013668. Elsevier, Amsterdam (2013)","DOI":"10.1016\/j.socnet.2013.09.003"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Smith, J.A., Moody, J., Morgan, J.H.: Network sampling coverage II: the effect of non-random missing data on network measurement. In: Social Networks, vol. 48, pp. 78\u201399. Elsevier, Amsterdam (2017)","DOI":"10.1016\/j.socnet.2016.04.005"},{"key":"9_CR25","unstructured":"The Internet Archive. The Internet Archive, 1996\u20132017"},{"key":"9_CR26","unstructured":"Vattani, A., Chakrabarti, D., Gurevich, M.: Preserving personalized pagerank in subgraphs. In: Proceedings of ICML (2011)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Wang, D.J., Shi, X., McFarland, D.A., Leskovec, J.: Measurement error in network data: a re-classification. In: Social Networks, vol. 34, pp. 396\u2013409. Elsevier, Amsterdam (2012)","DOI":"10.1016\/j.socnet.2012.01.003"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Wang, T., Chen, Y., Zhang, Z., Sun, P., Deng, B., Li, X.: Unbiased sampling in directed social graph. In: ACM SIGCOMM Computer Communication Review, vol. 40, pp. 401\u2013402. ACM (2010)","DOI":"10.1145\/1851182.1851231"},{"issue":"4","key":"9_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2847526","volume":"40","author":"Z Zhou","year":"2016","unstructured":"Zhou, Z., Zhang, N., Gong, Z., Das, G.: Faster random walks by rewiring online social networks on-the-fly. ACM Trans. Database Syst. (TODS) 40(4), 1\u201336 (2016)","journal-title":"ACM Trans. Database Syst. (TODS)"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05411-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:55:45Z","timestamp":1775289345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05411-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,2]]},"ISBN":["9783030054106","9783030054113"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05411-3_9","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,2]]},"assertion":[{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}