{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T16:53:32Z","timestamp":1789836812561,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CAREER award","award":["CCF-1149756"],"award-info":[{"award-number":["CCF-1149756"]}]},{"name":"NSF Big data","award":["IIS-1546488"],"award-info":[{"award-number":["IIS-1546488"]}]},{"name":"NSF Center for Science of Information STC","award":["CCF-093937"],"award-info":[{"award-number":["CCF-093937"]}]},{"name":"DARPA SIMPLEX"},{"name":"Sloan Research Fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098128","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T14:35:54Z","timestamp":1501857354000},"page":"817-826","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Revisiting Power-law Distributions in Spectra of Real World Networks"],"prefix":"10.1145","author":[{"given":"Nicole","family":"Eikmeier","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060693"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"e_1_3_2_1_3_1","volume-title":"Marvel universe looks almost like a real social network. arXiv, cond-mat.dis-nn:0202174","author":"Alberich R.","year":"2002","unstructured":"R. Alberich , J. Miro-Julia , and F. Rossello . Marvel universe looks almost like a real social network. arXiv, cond-mat.dis-nn:0202174 , 2002 . R. Alberich, J. Miro-Julia, and F. Rossello. Marvel universe looks almost like a real social network. arXiv, cond-mat.dis-nn:0202174, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_5_1","volume-title":"The www network. Accessed online via http:\/\/www.nd.edu\/~networks\/resources.htm","author":"Barab\u00e1si A.-L.","year":"2009","unstructured":"A.-L. Barab\u00e1si , H. Jeong , and R. Albert . The www network. Accessed online via http:\/\/www.nd.edu\/~networks\/resources.htm in May 2009 , 1999. A.-L. Barab\u00e1si, H. Jeong, and R. Albert. The www network. Accessed online via http:\/\/www.nd.edu\/~networks\/resources.htm in May 2009, 1999."},{"key":"e_1_3_2_1_6_1","unstructured":"V. Batagelj and A. Mrvar. Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ 2006.  V. Batagelj and A. Mrvar. Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9340-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056122"},{"key":"e_1_3_2_1_9_1","volume-title":"Geometric protean graphs. Internet Mathematics, 8(1--2):2--28","author":"Bonato A.","year":"2012","unstructured":"A. Bonato , J. Janssen , and P. Pra\u0142lat . Geometric protean graphs. Internet Mathematics, 8(1--2):2--28 , 2012 . A. Bonato, J. Janssen, and P. Pra\u0142lat. Geometric protean graphs. Internet Mathematics, 8(1--2):2--28, 2012."},{"key":"e_1_3_2_1_10_1","volume-title":"Fast matrix computations for pairwise and columnwise commute times and Katz scores. Internet Mathematics, 8(1--2):73--112","author":"Bonchi F.","year":"2012","unstructured":"F. Bonchi , P. Esfandiar , D. F. Gleich , C. Greif , and L. V. Lakshmanan . Fast matrix computations for pairwise and columnwise commute times and Katz scores. Internet Mathematics, 8(1--2):73--112 , 2012 . F. Bonchi, P. Esfandiar, D. F. Gleich, C. Greif, and L. V. Lakshmanan. Fast matrix computations for pairwise and columnwise commute times and Katz scores. Internet Mathematics, 8(1--2):73--112, 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000260300002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0937490100"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.018701"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187980.2188235"},{"issue":"1","key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2049662.2049663","article-title":"The University of Florida sparse matrix collection","volume":"38","author":"Davis T. A.","year":"2011","unstructured":"T. A. Davis and Y. Hu . The University of Florida sparse matrix collection . ACM Trans. Math. Softw. , 38 ( 1 ):1: 1 -- 1 :25, December 2011 . T. A. Davis and Y. Hu. The University of Florida sparse matrix collection. ACM Trans. Math. Softw., 38(1):1:1--1:25, December 2011.","journal-title":"ACM Trans. Math. Softw."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186785.1186788"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_31"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_21_1","unstructured":"J. R. Gilbert and S.-H. Teng. MESHPART: Matlab mesh partitioning and graph separator toolbox. http:\/\/www.cerfacs.fr\/algor\/Softs\/MESHPART\/ February 2002.  J. R. Gilbert and S.-H. Teng. MESHPART: Matlab mesh partitioning and graph separator toolbox. http:\/\/www.cerfacs.fr\/algor\/Softs\/MESHPART\/ February 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"e_1_3_2_1_23_1","volume-title":"A repository of graph spectra. In preparation","author":"Gleich D. F.","year":"2017","unstructured":"D. F. Gleich . A repository of graph spectra. In preparation , 2017 . D. F. Gleich. A repository of graph spectra. In preparation, 2017."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525903001067"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.051903"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00316-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/516121"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"e_1_3_2_1_31_1","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth D. E.","year":"1993","unstructured":"D. E. Knuth . The Stanford GraphBase: A Platform for Combinatorial Computing . Addison-Wesley , 1993 . D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, 1993."},{"key":"e_1_3_2_1_32_1","volume-title":"Large cliques in sparse random intersection graphs. arXiv, math.CO:1302.4627","author":"Kurauskas V.","year":"2013","unstructured":"V. Kurauskas and M. Bloznelis . Large cliques in sparse random intersection graphs. arXiv, math.CO:1302.4627 , 2013 . V. Kurauskas and M. Bloznelis. Large cliques in sparse random intersection graphs. arXiv, math.CO:1302.4627, 2013."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"e_1_3_2_1_36_1","unstructured":"J. Leskovec. The Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/index.html 2016.  J. Leskovec. The Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/index.html 2016."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_38_1","volume-title":"Marsh","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec , J. Kleinberg , and C. Faloutsos . Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1) , Marsh 2007 . J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1), Marsh 2007."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/505680.505683"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1561\/106.00000003"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45726-7_20"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_45_1","volume-title":"plfit software. https:\/\/github.com\/ntamas\/plfit","author":"Nepusz T.","year":"2016","unstructured":"T. Nepusz . plfit software. https:\/\/github.com\/ntamas\/plfit , 2016 . T. Nepusz. plfit software. https:\/\/github.com\/ntamas\/plfit, 2016."},{"key":"e_1_3_2_1_46_1","unstructured":"M. Newman. Network datasets. http:\/\/www-personal.umich.edu\/ mejn\/netdata\/ 2006.  M. Newman. Network datasets. http:\/\/www-personal.umich.edu\/ mejn\/netdata\/ 2006."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0151027"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772778"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835791"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488486"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_1_54_1","unstructured":"C. (The Cooperative Association for Internet Data Analyais). Network datasets. http:\/\/www.caida.org\/tools\/measurement\/skitter\/router_topology\/ 2005. Accessed in 2005.  C. (The Cooperative Association for Internet Data Analyais). Network datasets. http:\/\/www.caida.org\/tools\/measurement\/skitter\/router_topology\/ 2005. Accessed in 2005."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/1983675"},{"issue":"1","key":"e_1_3_2_1_57_1","first-page":"1","article-title":"ACM Trans","volume":"37","author":"V\u00f6mel C.","year":"2010","unstructured":"C. V\u00f6mel . Scalapack's MRRR algorithm. ACM Trans . Math. Softw. , 37 ( 1 ):1: 1 -- 1 :35, January 2010 . C. V\u00f6mel. Scalapack's MRRR algorithm. ACM Trans. Math. Softw., 37(1):1:1--1:35, January 2010.","journal-title":"Math. Softw."},{"key":"e_1_3_2_1_58_1","volume-title":"The Sceince of a Connected Age","author":"Watts D. J.","year":"2003","unstructured":"D. J. Watts . Six Degrees : The Sceince of a Connected Age . W. W. Norton and Company , 500 Fifth Avenue, New York, N.Y. 10110, 2003 . D. J. Watts. Six Degrees: The Sceince of a Connected Age. W. W. Norton and Company, 500 Fifth Avenue, New York, N.Y. 10110, 2003."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:30:02Z","timestamp":1750203002000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":58,"alternative-id":["10.1145\/3097983.3098128","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098128","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}