{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:47Z","timestamp":1750306547512,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Army Research Office","award":["W911NF-14-1- 0029"],"award-info":[{"award-number":["W911NF-14-1- 0029"]}]},{"name":"National Science Foundation","award":["1017181","1452425"],"award-info":[{"award-number":["1017181","1452425"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2740908.2743055","type":"proceedings-article","created":{"date-parts":[[2016,2,6]],"date-time":"2016-02-06T00:01:06Z","timestamp":1454716866000},"page":"275-281","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Correlation of Node Importance Measures"],"prefix":"10.1145","author":[{"given":"Mirza Basim","family":"Baig","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leman","family":"Akoglu","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339631"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"R. Albert H. Jeong and A.-L. Barab\u00e1si. Error and attack tolerance of complex networks. Nature 406(6794) 2000.  R. Albert H. Jeong and A.-L. Barab\u00e1si. Error and attack tolerance of complex networks. Nature 406(6794) 2000.","DOI":"10.1038\/35019019"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Beygelzimer G. Grinstein R. Linsker and I. Rish. Improving network robustness by edge modification. Physica A: Stat. Mech. and its Appl. 357(3--4):593--612 2005.  A. Beygelzimer G. Grinstein R. Linsker and I. Rish. Improving network robustness by edge modification. Physica A: Stat. Mech. and its Appl. 357(3--4):593--612 2005.","DOI":"10.1016\/j.physa.2005.03.040"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(88)90014-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.37"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.86.3682"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"P. Crucitti V. Latora M. Marchiori and A. Rapisarda. Error and attack tolerance of complex networks. Physica A: Stat. Mech. and its Appl. (1--3):388--394 2004.  P. Crucitti V. Latora M. Marchiori and A. Rapisarda. Error and attack tolerance of complex networks. Physica A: Stat. Mech. and its Appl. (1--3):388--394 2004.","DOI":"10.1016\/j.physa.2004.04.031"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"E. Estrada. Network robustness to targeted attacks. the interplay of expansibility and degree distribution. Phys. J. B - Complex Systems 52(4):563--574 2006.  E. Estrada. Network robustness to targeted attacks. the interplay of expansibility and degree distribution. Phys. J. B - Complex Systems 52(4):563--574 2006.","DOI":"10.1140\/epjb\/e2006-00330-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.01.006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(96)00300-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)01336-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(94)00248-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020512"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.056109"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.121"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"issue":"4","key":"e_1_3_2_1_18_1","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"Kemeny J. G.","year":"1959","journal-title":"Daedalus"},{"key":"e_1_3_2_1_19_1","first-page":"81","volume-title":"Biometrika","author":"Kendall M. G.","year":"1938"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"G. N. Lance and W. T. Williams. A general theory of classificatory sorting strategies ii. clustering systems. The computer journal 10(3):271--277 1967.  G. N. Lance and W. T. Williams. A general theory of classificatory sorting strategies ii. clustering systems. The computer journal 10(3):271--277 1967.","DOI":"10.1093\/comjnl\/10.3.271"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398463"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnt010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401955"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.006"},{"volume-title":"Stanford InfoLab","year":"1999","author":"Page L.","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"R. B. Rothenberg J. J. Potterat D. E. Woodhouse W. W. Darrow S. Q. Muth and A. S. Klovdahl. Choosing a centrality measure: Epidemiologic correlates in the Colorado Springs study of social networks. Social Networks 17(3--4):273--297 1995.  R. B. Rothenberg J. J. Potterat D. E. Woodhouse W. W. Darrow S. Q. Muth and A. S. Klovdahl. Choosing a centrality measure: Epidemiologic correlates in the Colorado Springs study of social networks. Social Networks 17(3--4):273--297 1995.","DOI":"10.1016\/0378-8733(95)00267-R"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.118"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.11.002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396795"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.54"},{"issue":"1","key":"e_1_3_2_1_33_1","first-page":"16","article-title":"How Correlated Are Network Centrality Measures? Connections (Toronto","volume":"28","author":"Valente T. W.","year":"2008","journal-title":"Ont.)"},{"volume-title":"Phy. Rev. E","year":"2011","author":"Van Mieghem P.","key":"e_1_3_2_1_34_1"},{"volume-title":"Wiley NY","year":"1998","author":"Vapnik V.","key":"e_1_3_2_1_35_1"},{"key":"e_1_3_2_1_36_1","unstructured":"S. Vigna. A weighted correlation index for rankings with ties. CoRR abs\/1404.3325 2014.  S. Vigna. A weighted correlation index for rankings with ties. CoRR abs\/1404.3325 2014."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1512504.1512532"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/40\/11\/005"}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Florence Italy","acronym":"WWW '15"},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2740908.2743055","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2740908.2743055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:37Z","timestamp":1750227157000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2740908.2743055"}},"subtitle":["An Empirical Study through Graph Robustness"],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":39,"alternative-id":["10.1145\/2740908.2743055","10.1145\/2740908"],"URL":"https:\/\/doi.org\/10.1145\/2740908.2743055","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}