{"id":"https://openalex.org/W7129097890","doi":"https://doi.org/10.1145/3773966.3779378","title":"Efficient Monte Carlo Algorithms for Approximating Katz Centrality on Large Graphs","display_name":"Efficient Monte Carlo Algorithms for Approximating Katz Centrality on Large Graphs","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129097890","doi":"https://doi.org/10.1145/3773966.3779378"},"language":null,"primary_location":{"id":"doi:10.1145/3773966.3779378","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3773966.3779378","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Nineteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3773966.3779378","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126165953","display_name":"Garrett W. Cornett","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Garrett W. Cornett","raw_affiliation_strings":["Texas State University, San Marcos, TX, USA"],"raw_orcid":"https://orcid.org/0009-0005-1346-9443","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111162443","display_name":"Minh Vuong","orcid":"https://orcid.org/0009-0004-0274-9936"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Minh Phu Vuong","raw_affiliation_strings":["Texas State Universtiy, San Marcos, TX, USA"],"raw_orcid":"https://orcid.org/0009-0004-0274-9936","affiliations":[{"raw_affiliation_string":"Texas State Universtiy, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115666594","display_name":"Chul-Ho Lee","orcid":"https://orcid.org/0000-0002-4778-8996"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chul-Ho Lee","raw_affiliation_strings":["Texas State University, San Marcos, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-4778-8996","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19215426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1120","last_page":"1124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9329000115394592,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9329000115394592,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.01979999989271164,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.016899999231100082,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.8112999796867371},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.7458999752998352},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6301000118255615},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5490000247955322},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.545799970626831},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5440000295639038},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.490200012922287},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4496999979019165},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.42250001430511475},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.41449999809265137}],"concepts":[{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.8112999796867371},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.7458999752998352},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6301000118255615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5789999961853027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5666999816894531},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5490000247955322},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.545799970626831},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5440000295639038},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.490200012922287},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4496999979019165},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.3982999920845032},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38850000500679016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37929999828338623},{"id":"https://openalex.org/C137753397","wikidata":"https://www.wikidata.org/wiki/Q2434424","display_name":"Network science","level":3,"score":0.35100001096725464},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.3181000053882599},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31349998712539673},{"id":"https://openalex.org/C15482360","wikidata":"https://www.wikidata.org/wiki/Q15238499","display_name":"Monte Carlo algorithm","level":3,"score":0.30320000648498535},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.2734000086784363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2646999955177307},{"id":"https://openalex.org/C14539891","wikidata":"https://www.wikidata.org/wiki/Q1070305","display_name":"Chernoff bound","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C63320529","wikidata":"https://www.wikidata.org/wiki/Q7269435","display_name":"Quasi-Monte Carlo method","level":5,"score":0.2556999921798706},{"id":"https://openalex.org/C13153151","wikidata":"https://www.wikidata.org/wiki/Q1639846","display_name":"Hybrid Monte Carlo","level":4,"score":0.2547000050544739},{"id":"https://openalex.org/C2778408900","wikidata":"https://www.wikidata.org/wiki/Q1329258","display_name":"Cardinal number (linguistics)","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3773966.3779378","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3773966.3779378","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Nineteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3773966.3779378","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3773966.3779378","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Nineteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2026417691","https://openalex.org/W2028499920","https://openalex.org/W2791473713","https://openalex.org/W3122910277","https://openalex.org/W3137088607","https://openalex.org/W3157186187","https://openalex.org/W3202613539","https://openalex.org/W4211192810","https://openalex.org/W4213009331","https://openalex.org/W4321851522"],"related_works":[],"abstract_inverted_index":{"Katz":[0,76],"centrality":[1,77],"is":[2,23],"an":[3],"important":[4],"metric":[5],"for":[6],"measuring":[7],"the":[8,74,102,107,119],"relative":[9,95],"importance":[10],"of":[11,115],"nodes":[12,105],"in":[13,18,100,106],"a":[14],"graph,":[15],"commonly":[16],"used":[17],"social":[19],"networks.":[20],"This":[21],"measure":[22],"prohibitively":[24],"expensive":[25],"to":[26,33,43,49,112],"compute":[27],"exactly,":[28],"as":[29],"it":[30],"requires":[31],"up":[32],"cubic-time":[34],"complexity.":[35],"Although":[36],"several":[37],"approximation":[38],"methods":[39],"exist,":[40],"most":[41,103],"fail":[42],"exploit":[44],"parallelism,":[45],"limiting":[46],"their":[47],"scalability":[48],"large":[50],"graphs.":[51],"To":[52],"address":[53],"this":[54],"limitation,":[55],"we":[56],"propose":[57],"two":[58,111],"highly":[59],"parallelizable":[60],"Monte":[61],"Carlo":[62],"algorithms":[63],"based":[64],"on":[65,85],"random":[66],"walks":[67],"named":[68],"MC-Katz":[69],"and":[70,78,97],"MC-KatzP,":[71],"which":[72],"approximate":[73],"truncated":[75],"its":[79],"original":[80],"form,":[81],"respectively.":[82],"Empirical":[83],"results":[84],"nine":[86],"real-world":[87],"datasets":[88],"show":[89],"that":[90],"they":[91],"achieve":[92],"low":[93],"mean":[94],"error":[96],"high":[98],"accuracy":[99],"ranking":[101],"influential":[104],"networks,":[108],"while":[109],"delivering":[110],"three":[113],"orders":[114],"magnitude":[116],"speedups":[117],"over":[118],"baselines.":[120]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-17T00:00:00"}