{"id":"https://openalex.org/W3039487182","doi":"https://doi.org/10.1137/19m1286669","title":"Algorithms for #BIS-Hard Problems on Expander Graphs","display_name":"Algorithms for #BIS-Hard Problems on Expander Graphs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3039487182","doi":"https://doi.org/10.1137/19m1286669","mag":"3039487182"},"language":"en","primary_location":{"id":"doi:10.1137/19m1286669","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1286669","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":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/684d9c57-720b-4319-86b5-d978c73537ee","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031616295","display_name":"Matthew Jenssen","orcid":"https://orcid.org/0000-0003-0026-8501"},"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":"Matthew Jenssen","raw_affiliation_strings":["University of Oxford,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford,","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023231478","display_name":"Peter Keevash","orcid":"https://orcid.org/0000-0002-4605-5045"},"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":"Peter Keevash","raw_affiliation_strings":["University of Oxford,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford,","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010848870","display_name":"Will Perkins","orcid":"https://orcid.org/0000-0002-7937-7016"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Will Perkins","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0089,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.94988421,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"49","issue":"4","first_page":"681","last_page":"710"},"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":1.0,"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":1.0,"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.9997000098228455,"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"}},{"id":"https://openalex.org/T10591","display_name":"Theoretical and Computational Physics","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3104","display_name":"Condensed Matter Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7380817532539368},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.682441234588623},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6669191122055054},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.644589364528656},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6229764223098755},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6098995208740234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5392045378684998},{"id":"https://openalex.org/keywords/ising-model","display_name":"Ising model","score":0.47714850306510925},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46580415964126587},{"id":"https://openalex.org/keywords/potts-model","display_name":"Potts model","score":0.4497685730457306},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4288380742073059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11039459705352783},{"id":"https://openalex.org/keywords/statistical-physics","display_name":"Statistical physics","score":0.10361242294311523}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7380817532539368},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.682441234588623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6669191122055054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.644589364528656},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6229764223098755},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6098995208740234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5392045378684998},{"id":"https://openalex.org/C51329190","wikidata":"https://www.wikidata.org/wiki/Q1076349","display_name":"Ising model","level":2,"score":0.47714850306510925},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46580415964126587},{"id":"https://openalex.org/C98925819","wikidata":"https://www.wikidata.org/wiki/Q7235385","display_name":"Potts model","level":3,"score":0.4497685730457306},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4288380742073059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11039459705352783},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.10361242294311523},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/19m1286669","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1286669","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:pure.atira.dk:openaire_cris_publications/684d9c57-720b-4319-86b5-d978c73537ee","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/684d9c57-720b-4319-86b5-d978c73537ee","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Jenssen, M, Keevash, P & Perkins, W 2020, 'Algorithms for #BIS-hard problems on expander graphs', SIAM Journal on Computing, vol. 49, no. 4, pp. 681-710. https://doi.org/10.1137/19M1286669","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/684d9c57-720b-4319-86b5-d978c73537ee","is_oa":true,"landing_page_url":"http://pure-oai.bham.ac.uk/ws/files/96022734/ExpanderBIS.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Jenssen, M, Keevash, P & Perkins, W 2020, 'Algorithms for #BIS-hard problems on expander graphs', SIAM Journal on Computing, vol. 49, no. 4, pp. 681-710. https://doi.org/10.1137/19M1286669","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/684d9c57-720b-4319-86b5-d978c73537ee","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/684d9c57-720b-4319-86b5-d978c73537ee","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Jenssen, M, Keevash, P & Perkins, W 2020, 'Algorithms for #BIS-hard problems on expander graphs', SIAM Journal on Computing, vol. 49, no. 4, pp. 681-710. https://doi.org/10.1137/19M1286669","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6170772349","display_name":"Combinatorial Construction","funder_award_id":"647678","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G7926746001","display_name":"New approaches to Gibbs measures at the interface of probability and computational complexity","funder_award_id":"EP/P009913/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8342849666","display_name":null,"funder_award_id":"EP/P009913/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G952070818","display_name":null,"funder_award_id":"DMS-1847451","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/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1631603072","https://openalex.org/W1770469170","https://openalex.org/W1776308369","https://openalex.org/W1824395173","https://openalex.org/W1987107795","https://openalex.org/W1997999115","https://openalex.org/W2001556264","https://openalex.org/W2004724832","https://openalex.org/W2014488202","https://openalex.org/W2016267520","https://openalex.org/W2018047324","https://openalex.org/W2024710200","https://openalex.org/W2037139490","https://openalex.org/W2048759201","https://openalex.org/W2055193025","https://openalex.org/W2062332780","https://openalex.org/W2068344352","https://openalex.org/W2078168527","https://openalex.org/W2121284046","https://openalex.org/W2157869188","https://openalex.org/W2163208395","https://openalex.org/W2177243619","https://openalex.org/W2474151873","https://openalex.org/W2796897711","https://openalex.org/W2952808529","https://openalex.org/W2962998907","https://openalex.org/W2963152259","https://openalex.org/W2995442611","https://openalex.org/W3100445533","https://openalex.org/W3101482641","https://openalex.org/W3105058115"],"related_works":["https://openalex.org/W2154392321","https://openalex.org/W4394638894","https://openalex.org/W2156471645","https://openalex.org/W4288255086","https://openalex.org/W2981433101","https://openalex.org/W2082544030","https://openalex.org/W2963814747","https://openalex.org/W4300706663","https://openalex.org/W4226089622","https://openalex.org/W4252484501"],"abstract_inverted_index":{"We":[0,69],"give":[1],"a":[2,91],"fully":[3],"polynomial-time":[4],"approximation":[5],"scheme":[6],"(FPTAS)":[7],"and":[8,23,74],"an":[9],"efficient":[10,46,72],"sampling":[11,75],"algorithm":[12],"for":[13,36,43,50,77],"the":[14,24,54,57,61,65],"high-fugacity":[15],"hard-core":[16],"model":[17,28],"on":[18,29],"bounded-degree":[19,30],"bipartite":[20,83],"expander":[21,31],"graphs":[22,84],"low-temperature":[25],"ferromagnetic":[26],"Potts":[27],"graphs.":[32],"The":[33],"results":[34],"apply,":[35],"example,":[37],"to":[38],"random":[39,81],"(bipartite)":[40],"$\\Delta$-regular":[41,67,82],"graphs,":[42],"which":[44],"no":[45],"algorithms":[47,76],"were":[48],"known":[49],"these":[51],"problems":[52],"(with":[53],"exception":[55],"of":[56,64,80,93],"Ising":[58],"model)":[59],"in":[60],"nonuniqueness":[62],"regime":[63],"infinite":[66],"tree.":[68],"also":[70],"find":[71],"counting":[73],"proper":[78],"$q$-colorings":[79],"when":[85],"$q$":[86],"is":[87],"sufficiently":[88],"small":[89],"as":[90],"function":[92],"$\\Delta$.":[94]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}