{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:15:36Z","timestamp":1726060536864},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"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-36683-4_24","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T22:08:15Z","timestamp":1574806095000},"page":"291-302","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Case for Kendall\u2019s Assortativity"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Boldi","sequence":"first","affiliation":[]},{"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"8","key":"24_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/spe.587","volume":"34","author":"P Boldi","year":"2004","unstructured":"Boldi, P., Codenotti, B., Santini, M., Vigna, S.: UbiCrawler: a scalable fully distributed web crawler. Softw. Pract. Exp. 34(8), 711\u2013726 (2004)","journal-title":"Softw. Pract. Exp."},{"issue":"2","key":"24_CR2","first-page":"12:1","volume":"12","author":"P Boldi","year":"2019","unstructured":"Boldi, P., Marino, A., Santini, M., Vigna, S.: BUbiNG: Massive crawling for the masses. ACM Trans. Web 12(2), 12:1\u201312:26 (2019)","journal-title":"ACM Trans. Web"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD 2009: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 219\u2013228. ACM, New York (2009)","DOI":"10.1145\/1557019.1557049"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2307\/2334112","volume":"33","author":"HE Daniels","year":"1943","unstructured":"Daniels, H.E.: The relation between measures of correlation in the universe of sample permutations. Biometrika 33(2), 129\u2013135 (1943)","journal-title":"Biometrika"},{"issue":"268","key":"24_CR5","first-page":"732","volume":"49","author":"LA Goodman","year":"1954","unstructured":"Goodman, L.A., Kruskal, W.H.: Measures of association for cross classifications. J. Am. Stat. Assoc. 49(268), 732\u2013764 (1954)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/15427951.2014.927038","volume":"11","author":"P Hoorn van der","year":"2015","unstructured":"van der Hoorn, P., Litvak, N.: Degree-degree dependencies in directed networks with heavy-tailed degrees. Internet Math. 11(2), 155\u2013179 (2015)","journal-title":"Internet Math."},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/biomet\/33.3.239","volume":"33","author":"MG Kendall","year":"1945","unstructured":"Kendall, M.G.: The treatment of ties in ranking problems. Biometrika 33(3), 239\u2013251 (1945)","journal-title":"Biometrika"},{"issue":"5","key":"24_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"issue":"314","key":"24_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1080\/01621459.1966.10480879","volume":"61","author":"WR Knight","year":"1966","unstructured":"Knight, W.R.: A computer method for calculating Kendall\u2019s tau with ungrouped data. J. Am. Stat. Assoc. 61(314), 436\u2013439 (1966)","journal-title":"J. Am. Stat. Assoc."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Kurucz, M., Benczur, A., Csalogany, K., Lukacs, L.: Spectral clustering in telephone call graphs. In: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, WebKDD\/SNA-KDD 2007, pp. 82\u201391. ACM (2007)","DOI":"10.1145\/1348549.1348559"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, pp. 591\u2013600. ACM (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"022801","DOI":"10.1103\/PhysRevE.87.022801","volume":"87","author":"N Litvak","year":"2013","unstructured":"Litvak, N., van der Hofstad, R.: Uncovering disassortativity in large scale-free networks. Phys. Rev. E 87, 022801 (2013)","journal-title":"Phys. Rev. E"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342. ACM (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002)","journal-title":"Phys. Rev. Lett."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67, 026126 (2003)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman, C.: The proof and measurement of association between two things. Am. J. Psychol. 15(1), 72\u2013101 (1904)","journal-title":"Am. J. Psychol."},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1140\/epjb\/e2010-00219-x","volume":"76","author":"P Mieghem Van","year":"2010","unstructured":"Van Mieghem, P., Wang, H., Ge, X., Tang, S., Kuipers, F.A.: Influence of assortativity and degree-preserving rewiring on the spectra of networks. Eur. Phys. J. B 76(4), 643\u2013652 (2010)","journal-title":"Eur. Phys. J. B"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Vigna, S.: A weighted correlation index for rankings with ties. In: Srinivasan, S., Ramamritham, K., Kumar, A., Ravindra, M.P., Bertino, E., Kumar, R. (eds.) Proceedings of the 24th International Conference on World Wide Web, pp. 1166\u20131176. ACM (2015)","DOI":"10.1145\/2736277.2741088"}],"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-36683-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T22:12:08Z","timestamp":1574806328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_24","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 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"}}]}}