{"id":"https://openalex.org/W1974544894","doi":"https://doi.org/10.1137/110837863","title":"Noise Tolerance of Expanders and Sublinear Expansion Reconstruction","display_name":"Noise Tolerance of Expanders and Sublinear Expansion Reconstruction","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1974544894","doi":"https://doi.org/10.1137/110837863","mag":"1974544894"},"language":"en","primary_location":{"id":"doi:10.1137/110837863","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110837863","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5114021051","display_name":"Satyen Kale","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Satyen Kale","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020836845","display_name":"Yuval Peres","orcid":"https://orcid.org/0000-0001-5456-6323"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Peres","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038687804","display_name":"C. Seshadhri","orcid":"https://orcid.org/0000-0003-2163-3555"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Seshadhri","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114021051"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1106,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77772507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"42","issue":"1","first_page":"305","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.9345887303352356},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7045195698738098},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6083241701126099},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5765065550804138},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5340669751167297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5213231444358826},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5159853100776672},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46514689922332764},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.45861271023750305},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.4474579393863678},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.43995389342308044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4368676543235779},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38600417971611023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3679823875427246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34763163328170776},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.19930827617645264},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15403953194618225}],"concepts":[{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.9345887303352356},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7045195698738098},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6083241701126099},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5765065550804138},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5340669751167297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5213231444358826},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5159853100776672},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46514689922332764},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.45861271023750305},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.4474579393863678},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.43995389342308044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4368676543235779},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38600417971611023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3679823875427246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34763163328170776},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.19930827617645264},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15403953194618225},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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":2,"locations":[{"id":"doi:10.1137/110837863","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110837863","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.7629","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.7629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~csesha/pubs/full_reconstruct_expansion.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1970630090","https://openalex.org/W1980816908","https://openalex.org/W1985538939","https://openalex.org/W2016987856","https://openalex.org/W2018925011","https://openalex.org/W2033281046","https://openalex.org/W2052194338","https://openalex.org/W2069947312","https://openalex.org/W2073966617","https://openalex.org/W2087439135","https://openalex.org/W2115464252","https://openalex.org/W2141078756","https://openalex.org/W2569976290","https://openalex.org/W2611773579","https://openalex.org/W3083751883"],"related_works":["https://openalex.org/W2948826707","https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2982430984","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W1989103179"],"abstract_inverted_index":{"We":[0,129,157],"consider":[1],"the":[2,87,91,101,140,149,167,173,181],"problem":[3],"of":[4,25,90,103,152,166],"online":[5],"sublinear":[6,60,160],"expander":[7,39,141,168],"reconstruction":[8,182],"and":[9,74,176],"its":[10,70],"relation":[11],"to":[12,20,32,125,163],"random":[13,104,133],"walks":[14,105],"in":[15,72,79,85,94,106,139,148,172,180],"\u201cnoisy\"":[16],"expanders.":[17],"Given":[18],"access":[19],"an":[21],"adjacency":[22],"list":[23],"representation":[24],"a":[26,37,54,59,65,80,98,119,126,132],"bounded-degree":[27,38],"graph":[28,35,48,107,122],"$G$,":[29],"we":[30],"want":[31],"convert":[33],"this":[34,57,178],"into":[36],"$G'$":[40,49,73],"changing":[41],"$G$":[42],"as":[43,45],"little":[44],"possible.":[46],"The":[47],"will":[50,143],"be":[51],"output":[52],"by":[53,116],"distributed":[55,81],"filter:":[56],"is":[58,97],"time":[61,161],"procedure":[62,179],"that,":[63],"given":[64],"query":[66],"vertex,":[67],"outputs":[68],"all":[69,86],"neighbors":[71],"can":[75],"do":[76],"so":[77],"even":[78],"manner,":[82],"ensuring":[83],"consistency":[84],"answers.":[88],"One":[89],"main":[92],"tools":[93],"our":[95],"analysis":[96],"result":[99],"on":[100],"behavior":[102],"that":[108,113,131],"are":[109,114],"almost":[110,136],"expanders:":[111],"graphs":[112],"formed":[115],"arbitrarily":[117],"connecting":[118],"small":[120],"unknown":[121],"(the":[123],"noise)":[124],"large":[127],"expander.":[128],"show":[130],"walk":[134],"from":[135,170],"any":[137],"vertex":[138],"part":[142,169,175],"have":[144],"fast":[145],"mixing":[146],"properties,":[147],"general":[150],"setting":[151],"irreducible":[153],"finite":[154],"Markov":[155],"chains.":[156],"also":[158],"design":[159],"procedures":[162],"distinguish":[164],"vertices":[165],"those":[171],"noise":[174],"use":[177],"algorithm.":[183]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}