{"id":"https://openalex.org/W2285670408","doi":"https://doi.org/10.1137/16m1083906","title":"Approximation via Correlation Decay When Strong Spatial Mixing Fails","display_name":"Approximation via Correlation Decay When Strong Spatial Mixing Fails","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2285670408","doi":"https://doi.org/10.1137/16m1083906","mag":"2285670408"},"language":"en","primary_location":{"id":"doi:10.1137/16m1083906","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1083906","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1510.09193","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055688854","display_name":"Ivona Bez\u00e1kov\u00e1","orcid":"https://orcid.org/0000-0002-8966-5396"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ivona Bez\u00e1kov\u00e1","raw_affiliation_strings":["Rochester Institute Of Technology"],"affiliations":[{"raw_affiliation_string":"Rochester Institute Of Technology","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089713528","display_name":"Andreas Galanis","orcid":"https://orcid.org/0000-0003-3579-6531"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andreas Galanis","raw_affiliation_strings":["#N##TAB##TAB##TAB##TAB# Oxford University, United Kingdom#N##TAB##TAB##TAB#"],"affiliations":[{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# Oxford University, United Kingdom#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029293569","display_name":"Leslie Ann Goldberg","orcid":"https://orcid.org/0000-0003-1879-6089"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leslie Ann Goldberg","raw_affiliation_strings":["University of Oxford"],"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100354396","display_name":"Heng Guo","orcid":"https://orcid.org/0000-0001-8199-5596"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heng Guo","raw_affiliation_strings":["School of Informatics"],"affiliations":[{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088287514","display_name":"Daniel \u0160tefankovi\u010d","orcid":"https://orcid.org/0000-0002-4849-7955"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel \u0160tefankovi\u010d","raw_affiliation_strings":["Univ. Rochester"],"affiliations":[{"raw_affiliation_string":"Univ. Rochester","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5055688854"],"corresponding_institution_ids":["https://openalex.org/I155173764"],"apc_list":null,"apc_paid":null,"fwci":0.954,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7544486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"48","issue":"2","first_page":"279","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9972000122070312,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9872000217437744,"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/mathematics","display_name":"Mathematics","score":0.6839820742607117},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.5842936038970947},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5512555241584778},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.5496880412101746},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5414824485778809},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.538345456123352},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5115400552749634},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.49667292833328247},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45073381066322327},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42913684248924255},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.42811036109924316},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3657292127609253},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24436688423156738},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.20320257544517517},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14143607020378113},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.0982351005077362}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6839820742607117},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.5842936038970947},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5512555241584778},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.5496880412101746},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5414824485778809},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.538345456123352},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5115400552749634},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.49667292833328247},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45073381066322327},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42913684248924255},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.42811036109924316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3657292127609253},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24436688423156738},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.20320257544517517},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14143607020378113},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0982351005077362},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":13,"locations":[{"id":"doi:10.1137/16m1083906","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1083906","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:arXiv.org:1510.09193","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.09193","pdf_url":"https://arxiv.org/pdf/1510.09193","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2285670408","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1510.09193","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:drops-oai.dagstuhl.de:6325","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.45","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:2e634e7d-a767-4fa7-8335-2ff7b729466c","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:2e634e7d-a767-4fa7-8335-2ff7b729466c","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:d9ccf75b-0f46-4700-a1d0-f1b9e1f667ce","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:d9ccf75b-0f46-4700-a1d0-f1b9e1f667ce","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Conference"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/318a6e0f-676f-4a6b-88cd-eb28f08fee28","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/318a6e0f-676f-4a6b-88cd-eb28f08fee28","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bez\u00e1kov\u00e1, I, Galanis, A, Goldberg, L A, Guo, H & Stefankovic, D 2019, 'Approximation via Correlation Decay when Strong Spatial Mixing Fails', SIAM Journal on Computing, vol. 48, no. 2, pp. 279\u2013349. https://doi.org/10.1137/16M1083906","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/3be44314-86c6-4908-9501-b356ea298c94","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/3be44314-86c6-4908-9501-b356ea298c94","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bez\u00e1kov\u00e1, I, Galanis, A, Goldberg, L A, Guo, H & Stefankovic, D 2016, Approximation via Correlation Decay When Strong Spatial Mixing Fails. in I Chatzigiannakis (ed.), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. vol. 55, 45, Leibniz International Proceedings in Informatics (LIPIcs), vol. 55, Rome, Italy, pp. 45:1-45:13, 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science, Rome, Italy, 12/07/16. https://doi.org/10.4230/LIPIcs.ICALP.2016.45","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/318a6e0f-676f-4a6b-88cd-eb28f08fee28","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/318a6e0f-676f-4a6b-88cd-eb28f08fee28","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bez\u00e1kov\u00e1, I, Galanis, A, Goldberg, L A, Guo, H & Stefankovic, D 2019, 'Approximation via Correlation Decay when Strong Spatial Mixing Fails', SIAM Journal on Computing, vol. 48, no. 2, pp. 279\u2013349. https://doi.org/10.1137/16M1083906","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/3be44314-86c6-4908-9501-b356ea298c94","is_oa":true,"landing_page_url":"http://drops.dagstuhl.de/opus/volltexte/2016/6325/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bez\u00e1kov\u00e1, I, Galanis, A, Goldberg, L A, Guo, H & Stefankovic, D 2016, Approximation via Correlation Decay When Strong Spatial Mixing Fails. in I Chatzigiannakis (ed.), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. vol. 55, 45, Leibniz International Proceedings in Informatics (LIPIcs), vol. 55, Rome, Italy, pp. 45:1-45:13, 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science, Rome, Italy, 12/07/16. https://doi.org/10.4230/LIPIcs.ICALP.2016.45","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.1510.09193","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1510.09193","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.icalp.2016.45","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2016.45","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":""},{"id":"mag:2940141836","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#BezakovaGGGS16","pdf_url":null,"source":{"id":"https://openalex.org/S4306418971","display_name":"International Colloquium on Automata, Languages and Programming","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 Colloquium on Automata, Languages and Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1510.09193","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.09193","pdf_url":"https://arxiv.org/pdf/1510.09193","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G261685824","display_name":null,"funder_award_id":"CCF-1319987","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2824819309","display_name":null,"funder_award_id":"334828","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G5855577457","display_name":null,"funder_award_id":"CCF-1563757","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W977994861","https://openalex.org/W1728703596","https://openalex.org/W1776308369","https://openalex.org/W1799220988","https://openalex.org/W1943141007","https://openalex.org/W1986979529","https://openalex.org/W1987107795","https://openalex.org/W2004724832","https://openalex.org/W2024710200","https://openalex.org/W2036650989","https://openalex.org/W2048759201","https://openalex.org/W2068524660","https://openalex.org/W2073608764","https://openalex.org/W2075348750","https://openalex.org/W2105572930","https://openalex.org/W2149592811","https://openalex.org/W2152324554","https://openalex.org/W2162945291","https://openalex.org/W2170305306","https://openalex.org/W2218979919","https://openalex.org/W2549123310","https://openalex.org/W2963795759","https://openalex.org/W2964304407","https://openalex.org/W4236981399"],"related_works":["https://openalex.org/W2940141836","https://openalex.org/W2953053085","https://openalex.org/W2949880915","https://openalex.org/W2950466990","https://openalex.org/W2952952528","https://openalex.org/W2294664282","https://openalex.org/W2267502219","https://openalex.org/W2601449229","https://openalex.org/W3213985234","https://openalex.org/W2952769483","https://openalex.org/W2964265363","https://openalex.org/W30945357","https://openalex.org/W2952131701","https://openalex.org/W2944444349","https://openalex.org/W3179792452","https://openalex.org/W3016868194","https://openalex.org/W3036604581","https://openalex.org/W3113827893","https://openalex.org/W3201369752","https://openalex.org/W2786537543"],"abstract_inverted_index":{"Approximate":[0],"counting":[1,137,279,312],"via":[2],"correlation":[3,111],"decay":[4,112],"is":[5,73,195,210,247,303,322],"the":[6,12,16,23,26,41,56,61,77,82,87,103,133,154,174,211,256,261,294,300,307,319],"core":[7],"algorithmic":[8],"technique":[9,131,185,232],"used":[10],"in":[11,22,86,140,255,266,282,293],"sharp":[13],"delineation":[14],"of":[15,25,29,35,43,55,84,135,156,169,221,238,315],"computational":[17],"phase":[18],"transition":[19],"that":[20,50,59,72,99,193,292],"arises":[21],"approximation":[24,119,206,218,264],"partition":[27,301],"function":[28,302],"antiferromagnetic":[30],"2-spin":[31],"models.":[32],"Previous":[33],"analyses":[34],"correlation-decay":[36],"algorithms":[37],"implicitly":[38],"depended":[39],"on":[40,153],"occurrence":[42],"strong":[44,124,170],"spatial":[45,125,171],"mixing.":[46],"This,":[47],"roughly,":[48],"means":[49],"one":[51],"uses":[52],"worst-case":[53,78],"analysis":[54,70],"recursive":[57],"procedure":[58],"creates":[60],"subinstances.":[62],"In":[63],"this":[64,177,267],"paper,":[65],"we":[66,93],"develop":[67],"a":[68,116,149,187],"new":[69],"method":[71],"more":[74],"refined":[75],"than":[76,251],"analysis.":[79],"We":[80,128,289],"take":[81],"shape":[83],"instances":[85,98],"computation":[88],"tree":[89],"into":[90],"consideration":[91],"and":[92,113,147,159,166,200,224],"amortize":[94],"against":[95],"certain":[96],"\u201cbad\u201d":[97],"are":[100],"created":[101],"as":[102],"recursion":[104],"proceeds.":[105],"This":[106,245],"enables":[107],"us":[108],"to":[109,114,132,182,275],"show":[110],"obtain":[115],"fully":[117,215],"polynomial-time":[118,216],"scheme":[120,207,219,265],"(FPTAS)":[121],"even":[122,305],"when":[123],"mixing":[126,172],"fails.":[127],"apply":[129],"our":[130],"problem":[134],"approximately":[136,311],"independent":[138,296],"sets":[139,281,314],"hypergraphs":[141],"with":[142,148,285],"degree":[143],"upper":[144],"bound":[145,151,246],"$\\Delta$":[146],"lower":[150],"$k$":[152],"arity":[155],"hyperedges.":[157],"Liu":[158],"Lin":[160],"gave":[161],"an":[162,196,241,276],"FPTAS":[163,197,242,277],"for":[164,190,198,208,229,235,243,278],"$k\\geq2$":[165],"$\\Delta\\leq5$":[167],"(lack":[168],"was":[173],"obstacle":[175],"preventing":[176],"algorithm":[178],"from":[179],"being":[180],"generalized":[181],"$\\Delta=6$).":[183],"Our":[184,231],"gives":[186,260],"tight":[188],"result":[189],"$\\Delta=6$,":[191],"showing":[192],"there":[194],"$k\\geq3$":[199],"$\\Delta\\leq6$.":[201],"The":[202],"best":[203],"previously":[204],"known":[205],"$\\Delta=6$":[209],"Markov-chain":[212],"simulation":[213],"based":[214],"randomized":[217,253],"(FPRAS)":[220],"Bordewich,":[222],"Dyer,":[223],"Karpinski,":[225],"which":[226],"only":[227],"works":[228],"$k\\geq8$.":[230],"also":[233],"applies":[234],"larger":[236],"values":[237],"$k$,":[239],"giving":[240],"$k\\geq\\Delta$.":[244],"not":[248],"substantially":[249],"stronger":[250],"existing":[252,271],"results":[254],"literature.":[257],"Nevertheless,":[258],"it":[259,273],"first":[262],"deterministic":[263],"regime.":[268,309],"Moreover,":[269],"unlike":[270],"results,":[272],"leads":[274],"dominating":[280,313],"regular":[283],"graphs":[284,317],"sufficiently":[286],"large":[287],"degree.":[288],"further":[290],"demonstrate":[291],"hypergraph":[295],"set":[297],"model,":[298],"approximating":[299],"NP-hard":[304],"within":[306],"uniqueness":[308],"Also,":[310],"bounded-degree":[316],"(without":[318],"regularity":[320],"restriction)":[321],"NP-hard.":[323]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}