{"id":"https://openalex.org/W2257861360","doi":"https://doi.org/10.1145/2554797.2554831","title":"Limits of local algorithms over sparse random graphs","display_name":"Limits of local algorithms over sparse random graphs","publication_year":2014,"publication_date":"2014-01-12","ids":{"openalex":"https://openalex.org/W2257861360","doi":"https://doi.org/10.1145/2554797.2554831","mag":"2257861360"},"language":"en","primary_location":{"id":"doi:10.1145/2554797.2554831","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2554797.2554831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th conference on Innovations in theoretical computer science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031648070","display_name":"David Gamarnik","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Gamarnik","raw_affiliation_strings":["Massachusettes Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusettes Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":25.0289,"has_fulltext":false,"cited_by_count":107,"citation_normalized_percentile":{"value":0.99971599,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"369","last_page":"376"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/multiplicative-function","display_name":"Multiplicative function","score":0.6781277656555176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6013141870498657},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.5898134708404541},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5829042792320251},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5340807437896729},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.508866548538208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.506740152835846},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43442004919052124},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4343150854110718},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.41891908645629883},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4118679165840149},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39071783423423767},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3839850425720215},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.34063705801963806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3261614143848419},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.18316474556922913}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6781277656555176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6013141870498657},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.5898134708404541},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5829042792320251},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5340807437896729},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.508866548538208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.506740152835846},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43442004919052124},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4343150854110718},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.41891908645629883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4118679165840149},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39071783423423767},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3839850425720215},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.34063705801963806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3261614143848419},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.18316474556922913},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2554797.2554831","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2554797.2554831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th conference on Innovations in theoretical computer science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W191748401","https://openalex.org/W1655742870","https://openalex.org/W1697928289","https://openalex.org/W1732919352","https://openalex.org/W1767800602","https://openalex.org/W1820010562","https://openalex.org/W1869295411","https://openalex.org/W1980155175","https://openalex.org/W1989036756","https://openalex.org/W2017186918","https://openalex.org/W2018483383","https://openalex.org/W2054910423","https://openalex.org/W2063428816","https://openalex.org/W2068871408","https://openalex.org/W2069603099","https://openalex.org/W2071114738","https://openalex.org/W2079330337","https://openalex.org/W2082734581","https://openalex.org/W2083116175","https://openalex.org/W2087113927","https://openalex.org/W2102699055","https://openalex.org/W2109330224","https://openalex.org/W2111754130","https://openalex.org/W2117195616","https://openalex.org/W2130042807","https://openalex.org/W2137365113","https://openalex.org/W2153822379","https://openalex.org/W2163712938","https://openalex.org/W2257861360","https://openalex.org/W2534584408","https://openalex.org/W2566505556","https://openalex.org/W2905110430","https://openalex.org/W2952246906","https://openalex.org/W2963876272","https://openalex.org/W3103834525","https://openalex.org/W3144881883","https://openalex.org/W6675386667","https://openalex.org/W6723629830","https://openalex.org/W6728814109","https://openalex.org/W6763917328"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W3030122542","https://openalex.org/W4283803822","https://openalex.org/W1968027460","https://openalex.org/W2168519036","https://openalex.org/W1608132493","https://openalex.org/W1492613353","https://openalex.org/W1811247372","https://openalex.org/W189991083","https://openalex.org/W4288281541"],"abstract_inverted_index":{"Local":[0],"algorithms":[1,5,26,56,74,99,129],"on":[2,10,83],"graphs":[3,71],"are":[4],"that":[6,54,97,122,132],"run":[7],"in":[8,61,70,80,108],"parallel":[9],"the":[11,23,39,50,81,133],"nodes":[12,33],"of":[13,22,38,63,140],"a":[14,87,137],"graph":[15,84],"to":[16,34,90,103],"compute":[17,104],"some":[18,46],"global":[19,40],"structural":[20],"feature":[21],"graph.":[24],"Such":[25],"use":[27],"only":[28],"local":[29,36,98,128],"information":[30],"available":[31],"at":[32,141],"determine":[35],"aspects":[37],"structure,":[41],"while":[42],"also":[43,76],"potentially":[44],"using":[45],"randomness.":[47],"Research":[48],"over":[49],"years":[51],"has":[52],"shown":[53],"such":[55],"can":[57],"be":[58,101],"surprisingly":[59],"powerful":[60],"terms":[62],"computing":[64],"structures":[65],"like":[66],"large":[67],"independent":[68,106,124],"sets":[69,107],"locally.":[72],"These":[73],"have":[75],"been":[77],"implicitly":[78],"considered":[79],"work":[82],"limits,":[85],"where":[86],"conjecture":[88,119],"due":[89],"Hatami,":[91],"Lov\u00e1sz":[92],"and":[93,120],"Szegedy":[94],"[17]":[95],"implied":[96],"may":[100],"able":[102],"near-maximum":[105],"(sparse)":[109],"random":[110],"d-regular":[111],"graphs.":[112],"In":[113],"this":[114,118],"paper":[115],"we":[116],"refute":[117],"show":[121],"every":[123],"set":[125],"produced":[126],"by":[127,136],"is":[130],"smaller":[131],"largest":[134],"one":[135],"multiplicative":[138],"factor":[139],"least":[142],"1/2+1/(2\u221a2)":[143],"\u2248":[144],".853,":[145],"asymptotically":[146],"as":[147],"d":[148],"\u2192":[149],"\u221e.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}