{"id":"https://openalex.org/W3082892514","doi":"https://doi.org/10.4230/lipics.approx/random.2020.25","title":"Chernoff Bound for High-Dimensional Expanders","display_name":"Chernoff Bound for High-Dimensional Expanders","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3082892514","doi":"https://doi.org/10.4230/lipics.approx/random.2020.25","mag":"3082892514"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12628","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.25","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109110331","display_name":"Tali Kaufman","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"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":["IL","US"],"is_corresponding":false,"raw_author_name":"Kaufman, Tali","raw_affiliation_strings":["Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel","Massachusetts Institute of Technology, Cambridge, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, United States","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029698763","display_name":"Ella Sharakanski","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sharakanski, Ella","raw_affiliation_strings":["Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3804,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67588688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"22","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9998999834060669,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9998999834060669,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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.8609070777893066},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7638494968414307},{"id":"https://openalex.org/keywords/chernoff-bound","display_name":"Chernoff bound","score":0.6433085203170776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5430935621261597},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.533692479133606},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5019724369049072},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.49725964665412903},{"id":"https://openalex.org/keywords/spectral-gap","display_name":"Spectral gap","score":0.45638635754585266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4494471549987793},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.39633965492248535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37047383189201355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2774691581726074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23879456520080566},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2315349578857422},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1586616039276123}],"concepts":[{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.8609070777893066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7638494968414307},{"id":"https://openalex.org/C14539891","wikidata":"https://www.wikidata.org/wiki/Q1070305","display_name":"Chernoff bound","level":2,"score":0.6433085203170776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5430935621261597},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.533692479133606},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5019724369049072},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.49725964665412903},{"id":"https://openalex.org/C2778114796","wikidata":"https://www.wikidata.org/wiki/Q7575194","display_name":"Spectral gap","level":2,"score":0.45638635754585266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4494471549987793},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.39633965492248535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37047383189201355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2774691581726074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23879456520080566},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2315349578857422},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1586616039276123}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:12628","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.approx/random.2020.25","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:3082892514","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2020/12628/pdf/LIPIcs-APPROX25.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306420261","display_name":"International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12628","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3209913008","https://openalex.org/W2127843284","https://openalex.org/W2949295379","https://openalex.org/W3106353459","https://openalex.org/W3084071216","https://openalex.org/W2961133442","https://openalex.org/W2888794526","https://openalex.org/W2952568439","https://openalex.org/W2950377131","https://openalex.org/W2614221311","https://openalex.org/W2262604408","https://openalex.org/W2778748440","https://openalex.org/W2215445442","https://openalex.org/W3111554155","https://openalex.org/W2105094919","https://openalex.org/W317642749","https://openalex.org/W1882460190","https://openalex.org/W2197696721","https://openalex.org/W2578263278","https://openalex.org/W3105371452"],"abstract_inverted_index":{"We":[0,77],"generalize":[1],"the":[2,34,39,63,67,73,97,132,175,193,200,206,218,223,227,237,278,281,284,287,304],"expander":[3,10,98,102,126,182,307],"Chernoff":[4,11,84,99,153,167,183,274,308],"bound":[5,12,59,85,100,111,154,168,184,275,300],"to":[6,51,104,113,149,163],"high-dimensional":[7,91,105,118,156,170,235,273,306],"expanders.":[8,92,157],"The":[9],"is":[13,139,147,213,221,247,267,301],"an":[14,82,181],"essential":[15],"property":[16],"of":[17,41,66,96,129,135,195,199,208,226,239,261,280],"expanders,":[18,205,236],"first":[19],"proved":[20],"by":[21,172,215],"Gillman":[22],"[Gillman,":[23],"1993].":[24],"Given":[25],"a":[26,30,46,58,108,151,165,188,196,272,290],"graph":[27],"G":[28,50],"and":[29,69,120,293],"function":[31,210,250,285],"f":[32],"on":[33,49,62,90,187,286],"vertices,":[35],"it":[36],"states":[37],"that":[38,60,115,145,185,190,232,241,276],"probability":[40],"f\u2019s":[42],"mean":[43,266],"sampled":[44],"via":[45],"random":[47,137],"walk":[48,68],"deviate":[52],"from":[53,101,245,254,257,297],"its":[54,265],"actual":[55],"mean,":[56],"has":[57,289],"depends":[61,186],"spectral":[64,133,176,201,219],"gap":[65,134,220],"decreases":[70],"exponentially":[71],"as":[72],"walk\u2019s":[74],"length":[75],"increases.":[76],"are":[78,121],"interested":[79],"in":[80,117,124,233],"obtaining":[81],"analog":[83],"for":[86,155,169],"high":[87],"order":[88],"walks":[89,138],"A":[93,142,249],"naive":[94,305],"generalization":[95],"graphs":[103],"expanders":[106,119,171],"gives":[107],"very":[109],"poor":[110],"due":[112],"obstructions":[114],"occur":[116],"not":[122,243,252,295],"present":[123],"(one-dimensional)":[125],"graphs.":[127],"Because":[128],"these":[130],"obstructions,":[131],"high-order":[136],"inherently":[140],"small.":[141],"natural":[143],"question":[144],"arises":[146],"how":[148],"get":[150,164],"meaningful":[152],"In":[158,203],"this":[159],"paper,":[160],"we":[161,179,191,230,270],"manage":[162],"strong":[166],"looking":[173],"beyond":[174],"gap.":[177,202],"First,":[178],"prove":[180,271],"notion":[189],"call":[192],"\"shrinkage":[194],"function\"":[197],"instead":[198],"one-dimensional":[204,224],"shrinkage":[207,238],"any":[209,258],"with":[211],"zero-mean":[212],"bounded":[214],"\u03bb(M).":[216],"Therefore,":[217],"just":[222],"manifestation":[225],"shrinkage.":[228],"Next,":[229],"show":[231],"good":[234],"functions":[240],"\"do":[242],"come":[244,253],"below\"":[246],"good.":[248],"does":[251,294],"below":[255],"if":[256],"local":[259],"point":[260],"view":[262],"(called":[263],"\"link\")":[264],"zero.":[268],"Finally,":[269],"captures":[277],"expansion":[279],"complex.":[282],"When":[283],"faces":[288],"small":[291],"variance":[292],"\"come":[296],"below\",":[298],"our":[299],"better":[302],"than":[303],"bound.":[309]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}