{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:51Z","timestamp":1760597931018},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366865"},{"type":"electronic","value":"9783030366872"}],"license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-36687-2_8","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T17:39:57Z","timestamp":1576517997000},"page":"90-101","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sampling on Networks: Estimating Eigenvector Centrality on Incomplete Networks"],"prefix":"10.1007","author":[{"given":"Nicol\u00f2","family":"Ruggeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caterina","family":"De Bacco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"De Choudhury, M., Lin, Y.R., Sundaram, H., Candan, K.S., Xie, L., Kelliher, A.: How does the data sampling strategy impact the discovery of information diffusion in social media?. In: Fourth International AAAI Conference on Weblogs and Social Media (2010)","DOI":"10.1609\/icwsm.v4i1.14024"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Sadikov, E., Medina, M., Leskovec, J., Garcia-Molina, H.: Correcting for missing data in information cascades. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 55\u201364. ACM (2011)","DOI":"10.1145\/1935826.1935844"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"8_CR4","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Data Compression Conference Proceedings DCC 2001, pp. 203\u2013212. IEEE (2001)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Frank, O.: Network sampling and model fitting. In: Models and Methods in Social Network Analysis, pp. 31\u201356 (2005)","DOI":"10.1017\/CBO9780511811395.003"},{"issue":"7","key":"8_CR6","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1038\/nbt1116","volume":"23","author":"J-DJ Han","year":"2005","unstructured":"Han, J.-D.J., Dupuy, D., Bertin, N., Cusick, M.E., Vidal, M.: Effect of sampling on topology predictions of protein-protein interaction networks. Nat. Biotechnol. 23(7), 839 (2005)","journal-title":"Nat. Biotechnol."},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"016102","DOI":"10.1103\/PhysRevE.73.016102","volume":"73","author":"SH Lee","year":"2006","unstructured":"Lee, S.H., Kim, P.-J., Jeong, H.: Statistical properties of sampled networks. Phys. Rev. E 73(1), 016102 (2006)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.socnet.2005.07.002","volume":"28","author":"G Kossinets","year":"2006","unstructured":"Kossinets, G.: Effects of missing data in social networks. Soc. Netw. 28(3), 247\u2013268 (2006)","journal-title":"Soc. Netw."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 2(1), 113\u2013120 (1972)","journal-title":"J. Math. Sociol."},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0378-8733(03)00012-1","volume":"25","author":"E Costenbader","year":"2003","unstructured":"Costenbader, E., Valente, T.W.: The stability of centrality measures when networks are sampled. Soc. Netw. 25(4), 283\u2013307 (2003)","journal-title":"Soc. Netw."},{"key":"8_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Methods for Large Eigenvalues Problems","author":"Y Saad","year":"2011","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalues Problems. Manchester University Press, Manchester (2011)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.physa.2017.02.048","volume":"477","author":"N Blagus","year":"2017","unstructured":"Blagus, N., \u0160ubelj, L., Bajec, M.: Empirical comparison of network sampling: how to choose the most appropriate method? Physica A: Stat. Mech. Appl. 477, 136\u2013148 (2017)","journal-title":"Physica A: Stat. Mech. Appl."},{"key":"8_CR13","unstructured":"Morstatter, F., Pfeffer, J., Liu, H., Carley, K.M.: Is the sample good enough? comparing data from Twitter\u2019s streaming API with Twitter\u2019s firehose. In: Seventh International AAAI Conference on Weblogs and Social Media (2013)"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TNET.2008.2001730","volume":"17","author":"D Stutzbach","year":"2009","unstructured":"Stutzbach, D., Rejaie, R., Duffield, N., Sen, S., Willinger, W.: On unbiased sampling for unstructured peer-to-peer networks. IEEE\/ACM Trans. Netw. (TON) 17(2), 377\u2013390 (2009)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"H\u00fcbler, C., Kriegel, H.-P., Borgwardt, K., Ghahramani, Z.: Metropolis algorithms for representative subgraph sampling. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 283\u2013292. IEEE (2008)","DOI":"10.1109\/ICDM.2008.124"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"036118","DOI":"10.1103\/PhysRevE.72.036118","volume":"72","author":"MP Stumpf","year":"2005","unstructured":"Stumpf, M.P., Wiuf, C.: Sampling properties of random graphs: the degree distribution. Phys. Rev. E 72(3), 036118 (2005)","journal-title":"Phys. Rev. E"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Ganguly, A., Kolaczyk, E.D.: Estimation of vertex degrees in a sampled network. In: 2017 51st Asilomar Conference on Signals, Systems, and Computers, pp. 967\u2013974. IEEE (2018)","DOI":"10.1109\/ACSSC.2017.8335492"},{"key":"8_CR18","unstructured":"Antunes, N., Bhamidi, S., Guo, T., Pipiras, V., Wang, B.: Sampling-based estimation of in-degree distribution with applications to directed complex networks. arXiv preprint arXiv:1810.01300 (2018)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TSP.2015.2486740","volume":"64","author":"S Segarra","year":"2015","unstructured":"Segarra, S., Ribeiro, A.: Stability and continuity of centrality measures in weighted graphs. IEEE Trans. Signal Process. 64(3), 543\u2013555 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.9708\/jksci.2016.21.1.025","volume":"21","author":"C-G Han","year":"2016","unstructured":"Han, C.-G., Lee, S.-H.: Analysis of effect of an additional edge on eigenvector centrality of graph. J. Korea Soc. Comput. Inf. 21(1), 25\u201331 (2016)","journal-title":"J. Korea Soc. Comput. Inf."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Murai, S., Yoshida, Y.: Sensitivity analysis of centralities on unweighted networks. In: The World Wide Web Conference, pp. 1332\u20131342. ACM (2019)","DOI":"10.1145\/3308558.3313422"},{"issue":"1\u20137","key":"8_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Sakakura, Y., Yamaguchi, Y., Amagasa, T., Kitagawa, H.: An improved method for efficient PageRank estimation. In: International Conference on Database and Expert Systems Applications, pp. 208\u2013222. Springer (2014)","DOI":"10.1007\/978-3-319-10085-2_19"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Chen, Y.-Y., Gan, Q., Suel, T.: Local methods for estimating PageRank values. In: Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management, pp. 381\u2013389. ACM (2004)","DOI":"10.1145\/1031171.1031248"},{"key":"8_CR25","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. JHU Press, Baltimore (2012)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: a case study of unbiased sampling of OSNs. In: 2010 Proceedings IEEE Infocom, pp. 1\u20139. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"7","key":"8_CR27","doi-asserted-by":"publisher","first-page":"1868","DOI":"10.1016\/j.cam.2010.06.024","volume":"235","author":"M Romance","year":"2011","unstructured":"Romance, M.: Local estimates for eigenvector-like centralities of complex networks. J. Comput. Appl. Math. 235(7), 1868\u20131874 (2011)","journal-title":"J. Comput. Appl. Math."},{"issue":"5439","key":"8_CR28","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(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"1","key":"8_CR29","doi-asserted-by":"publisher","first-page":"016107","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer, B., Newman, M.E.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83(1), 016107 (2011)","journal-title":"Phys. Rev. E"},{"key":"8_CR30","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs, I. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae (Debrecen)"},{"issue":"15","key":"8_CR31","first-page":"13","volume":"11","author":"R Oliveira","year":"2008","unstructured":"Oliveira, R., Willinger, W., Zhang, B., et al.: Quantifying the completeness of the observed internet as-level structure. Work 11(15), 13\u201317 (2008)","journal-title":"Work"},{"issue":"1","key":"8_CR32","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data (TKDD) 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: International Semantic Web Conference, pp. 351\u2013368. Springer (2003)","DOI":"10.1007\/978-3-540-39718-2_23"},{"issue":"1","key":"8_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Sampling community structure. In: Proceedings of the 19th International Conference on World Wide Web, pp. 701\u2013710. ACM (2010)","DOI":"10.1145\/1772690.1772762"},{"issue":"1","key":"8_CR36","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., et al.: Random walks on graphs: a survey. Comb. Paul Erdos Eighty 2(1), 1\u201346 (1993)","journal-title":"Comb. Paul Erdos Eighty"},{"issue":"6","key":"8_CR37","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1214\/aoms\/1177705148","volume":"32","author":"LA Goodman","year":"1961","unstructured":"Goodman, L.A.: Snowball sampling. Ann. Math. Stat. 32, 148\u2013170 (1961)","journal-title":"Ann. Math. Stat."},{"key":"8_CR39","volume-title":"Nonparametric Statistics: A Step-by-Step Approach","author":"GW Corder","year":"2014","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric Statistics: A Step-by-Step Approach. Wiley, Hoboken (2014)"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36687-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T02:50:16Z","timestamp":1695523816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36687-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"ISBN":["9783030366865","9783030366872"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36687-2_8","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"26 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","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"}}]}}