{"id":"https://openalex.org/W1992806483","doi":"https://doi.org/10.1109/itw.2013.6691322","title":"Bypassing correlation decay for matchings with an application to XORSAT","display_name":"Bypassing correlation decay for matchings with an application to XORSAT","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W1992806483","doi":"https://doi.org/10.1109/itw.2013.6691322","mag":"1992806483"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2013.6691322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2013.6691322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"preprint","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/A5111986103","display_name":"Marc Lelarge","orcid":null},"institutions":[{"id":"https://openalex.org/I4210153302","display_name":"Geometric (India)","ror":"https://ror.org/04xprjz26","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210153302"]},{"id":"https://openalex.org/I4210103330","display_name":"\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/01dp7jr64","country_code":"BI","type":"education","lineage":["https://openalex.org/I4210103330"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["BI","FR","IN"],"is_corresponding":true,"raw_author_name":"Marc Lelarge","raw_affiliation_strings":["ENS, INRIA","Laboratoire d'informatique de l'\u00e9cole normale sup\u00e9rieure","Dynamics of Geometric Networks","Laboratory of Information, Network and Communication Sciences"],"affiliations":[{"raw_affiliation_string":"ENS, INRIA","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Laboratoire d'informatique de l'\u00e9cole normale sup\u00e9rieure","institution_ids":["https://openalex.org/I4210103330"]},{"raw_affiliation_string":"Dynamics of Geometric Networks","institution_ids":["https://openalex.org/I4210153302"]},{"raw_affiliation_string":"Laboratory of Information, Network and Communication Sciences","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111986103"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210103330","https://openalex.org/I4210153302"],"apc_list":null,"apc_paid":null,"fwci":0.6138,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.65022489,"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":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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.9968000054359436,"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/unimodular-matrix","display_name":"Unimodular matrix","score":0.796839714050293},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6869210004806519},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6486093401908875},{"id":"https://openalex.org/keywords/replica","display_name":"Replica","score":0.6060065031051636},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5652771592140198},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5561420321464539},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.540355920791626},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5195572376251221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5127599835395813},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35374099016189575},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33223700523376465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3245566487312317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28757768869400024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17363616824150085},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08686700463294983}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.796839714050293},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6869210004806519},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6486093401908875},{"id":"https://openalex.org/C2775937380","wikidata":"https://www.wikidata.org/wiki/Q1232589","display_name":"Replica","level":2,"score":0.6060065031051636},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5652771592140198},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5561420321464539},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.540355920791626},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5195572376251221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5127599835395813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35374099016189575},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33223700523376465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3245566487312317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28757768869400024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17363616824150085},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08686700463294983},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2013.6691322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2013.6691322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00917422v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00917422","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Information Theory Workshop, Sep 2013, Seville, Spain","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W191748401","https://openalex.org/W1528625750","https://openalex.org/W1533562602","https://openalex.org/W1757513105","https://openalex.org/W1991832118","https://openalex.org/W1992806483","https://openalex.org/W2013024470","https://openalex.org/W2033718639","https://openalex.org/W2055340828","https://openalex.org/W2055519174","https://openalex.org/W2060019200","https://openalex.org/W2083116175","https://openalex.org/W2126095574","https://openalex.org/W2165114349","https://openalex.org/W2170376751","https://openalex.org/W2566505556","https://openalex.org/W2764230287","https://openalex.org/W2952096314","https://openalex.org/W2963143776","https://openalex.org/W2964241292","https://openalex.org/W3105585314","https://openalex.org/W6631482757","https://openalex.org/W6653724072"],"related_works":["https://openalex.org/W2011745869","https://openalex.org/W2088028898","https://openalex.org/W3013979739","https://openalex.org/W2655578171","https://openalex.org/W1974942973","https://openalex.org/W2577913821","https://openalex.org/W211627054","https://openalex.org/W1608437562","https://openalex.org/W2083668208","https://openalex.org/W3141916192"],"abstract_inverted_index":{"Many":[0],"combinatorial":[1],"optimization":[2],"problems":[3],"on":[4,146],"sparse":[5],"graphs":[6,92,111,153],"do":[7],"not":[8],"exhibit":[9],"the":[10,17,33,41,51,59,69,79,82,104,113,123,130,147],"correlation":[11],"decay":[12],"property.":[13],"In":[14,28],"such":[15,43],"cases,":[16],"cavity":[18,60],"method":[19],"remains":[20],"a":[21,85,134],"sophisticated":[22],"heuristic":[23],"with":[24],"no":[25],"rigorous":[26],"proof.":[27],"this":[29],"paper,":[30],"we":[31,64,121],"consider":[32,122],"maximum":[34,86],"matching":[35],"problem":[36,52,126],"which":[37,127],"is":[38],"one":[39],"of":[40,50,72,84,103,106,115],"simplest":[42],"example.":[44],"We":[45,95,142],"show":[46],"that":[47],"monotonicity":[48],"properties":[49],"allows":[53],"us":[54],"to":[55,67,77,98,129,156],"define":[56],"solutions":[57],"for":[58,81,90,110,151],"equations.":[61],"More":[62],"importantly,":[63],"are":[65,93],"able":[66],"identify":[68],"`right'":[70],"solution":[71],"these":[73],"equations":[74],"and":[75,112],"then":[76],"compute":[78],"asymptotics":[80],"size":[83],"matching.":[87],"The":[88],"results":[89],"finite":[91],"self-contained.":[94],"give":[96],"references":[97],"recent":[99],"extensions":[100],"making":[101],"use":[102],"notion":[105],"local":[107],"weak":[108],"convergence":[109],"theory":[114],"unimodular":[116],"networks.":[117],"As":[118],"an":[119],"application,":[120],"random":[124],"XORSAT":[125],"according":[128],"physics":[131],"literature":[132],"has":[133],"`one-step":[135],"replica":[136],"symmetry":[137],"breaking'":[138],"(1RSB)":[139],"glass":[140],"phase.":[141],"derive":[143],"new":[144],"bounds":[145],"satisfiability":[148],"threshold":[149],"valid":[150],"general":[152],"(and":[154],"conjectured":[155],"be":[157],"tight).":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
