{"id":"https://openalex.org/W3214333250","doi":"https://doi.org/10.1145/3631354","title":"Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs","display_name":"Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs","publication_year":2023,"publication_date":"2023-11-09","ids":{"openalex":"https://openalex.org/W3214333250","doi":"https://doi.org/10.1145/3631354","mag":"3214333250"},"language":"en","primary_location":{"id":"doi:10.1145/3631354","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631354","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631354","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3631354","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, USA"],"affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology, USA","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":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","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, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088287514","display_name":"Daniel \u0160tefankovi\u010d","orcid":"https://orcid.org/0000-0002-4849-7955"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel \u0160tefankovi\u010d","raw_affiliation_strings":["University of Rochester, USA"],"affiliations":[{"raw_affiliation_string":"University of Rochester, USA","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5055688854"],"corresponding_institution_ids":["https://openalex.org/I155173764"],"apc_list":null,"apc_paid":null,"fwci":0.3347,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57478311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"20","issue":"1","first_page":"1","last_page":"26"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9890999794006348,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9884999990463257,"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.7256833910942078},{"id":"https://openalex.org/keywords/glauber","display_name":"Glauber","score":0.7198346853256226},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6881252527236938},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6339689493179321},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5306251049041748},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5026867389678955},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.47127029299736023},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4478694200515747},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43997904658317566},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43883591890335083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15250074863433838}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7256833910942078},{"id":"https://openalex.org/C2780708879","wikidata":"https://www.wikidata.org/wiki/Q5567254","display_name":"Glauber","level":3,"score":0.7198346853256226},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6881252527236938},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6339689493179321},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5306251049041748},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5026867389678955},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.47127029299736023},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4478694200515747},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43997904658317566},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43883591890335083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15250074863433838},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C191486275","wikidata":"https://www.wikidata.org/wiki/Q210028","display_name":"Scattering","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3631354","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631354","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631354","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:02f02282-7166-49e3-ac7c-1f1d2a5b9af7","is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:02f02282-7166-49e3-ac7c-1f1d2a5b9af7","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:749c7122-8881-4eff-80f9-bb67d6af077c","is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:749c7122-8881-4eff-80f9-bb67d6af077c","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.1145/3631354","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631354","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631354","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3400807426","display_name":null,"funder_award_id":"DUE-1819546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4283801434","display_name":null,"funder_award_id":"1819546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4667608296","display_name":"Collaborative Research: AF: Small:  Phase Transitions in Sampling Related Problems","funder_award_id":"2007287","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8713706437","display_name":null,"funder_award_id":"CCF-2007287","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3214333250.pdf","grobid_xml":"https://content.openalex.org/works/W3214333250.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W634962210","https://openalex.org/W1776308369","https://openalex.org/W2004724832","https://openalex.org/W2061468234","https://openalex.org/W2068524660","https://openalex.org/W2090216341","https://openalex.org/W2105572930","https://openalex.org/W2106285343","https://openalex.org/W2120894224","https://openalex.org/W2135481845","https://openalex.org/W2157869188","https://openalex.org/W2474151873","https://openalex.org/W2478722229","https://openalex.org/W2769516254","https://openalex.org/W2950334461","https://openalex.org/W2953161932","https://openalex.org/W2963400600","https://openalex.org/W2963410169","https://openalex.org/W2963516140","https://openalex.org/W2963795759","https://openalex.org/W2964262313","https://openalex.org/W3009865281","https://openalex.org/W3013409926","https://openalex.org/W3035156632","https://openalex.org/W3101482641","https://openalex.org/W3104444347","https://openalex.org/W3105058115","https://openalex.org/W3126279954","https://openalex.org/W3127673302","https://openalex.org/W3135924815","https://openalex.org/W3143901626","https://openalex.org/W3144881883","https://openalex.org/W3155374999","https://openalex.org/W3159235954","https://openalex.org/W3159848941","https://openalex.org/W3167575375","https://openalex.org/W3170539426","https://openalex.org/W3186061378","https://openalex.org/W3210984344","https://openalex.org/W4212998659","https://openalex.org/W4214908361","https://openalex.org/W4226518768","https://openalex.org/W4247564011","https://openalex.org/W4254539327","https://openalex.org/W4282003860","https://openalex.org/W4322622102","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W1515414572","https://openalex.org/W2950956395","https://openalex.org/W2173245850","https://openalex.org/W2079317597","https://openalex.org/W2560371573","https://openalex.org/W2025229065","https://openalex.org/W2045631952","https://openalex.org/W4367190712","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"Spectral":[0],"independence":[1],"is":[2,61,111,124],"a":[3,35,156],"recently":[4],"developed":[5],"framework":[6,22],"for":[7,34,46,81],"obtaining":[8],"sharp":[9],"bounds":[10,84,195],"on":[11,31,86,94,204],"the":[12,16,41,48,64,127,135,138,164,172,215],"convergence":[13],"time":[14,178],"of":[15,38,50,107,137,159],"classical":[17],"Glauber":[18,205],"dynamics.":[19],"This":[20],"new":[21],"has":[23,68],"yielded":[24],"optimal":[25],"O(n":[26],"log":[27],"n)":[28],"sampling":[29,51],"algorithms":[30,175,202],"bounded-degree":[32,65,153],"graphs":[33,95],"large":[36,188],"class":[37],"problems":[39,49],"throughout":[40,214],"so-called":[42],"uniqueness":[43,216],"regime,":[44],"including,":[45],"example,":[47],"independent":[52],"sets,":[53],"matchings,":[54],"and":[55,75,102,197],"Ising-model":[56],"configurations.":[57],"Our":[58,122,144],"main":[59,157],"contribution":[60],"to":[62,91,114,118,125,141,152,187,209],"relax":[63],"assumption":[66],"that":[67,149,207],"so":[69],"far":[70],"been":[71],"important":[72],"in":[73,177],"establishing":[74],"applying":[76,115],"spectral":[77,120],"independence.":[78,121],"Previous":[79],"methods":[80],"avoiding":[82],"degree":[83],"rely":[85],"using":[87],"L":[88,108,128],"p":[89,109,129],"-norms":[90,110],"analyse":[92,142],"contraction":[93],"with":[96],"bounded":[97],"connective":[98],"constant":[99,211],"(Sinclair,":[100],"Srivastava,":[101],"Yin,":[103],"FOCS\u201913).":[104],"The":[105],"non-linearity":[106],"an":[112],"obstacle":[113],"these":[116,193],"results":[117],"bound":[119],"solution":[123],"capture":[126],"-analysis":[130],"recursively":[131],"by":[132],"amortising":[133],"over":[134],"subtrees":[136],"recurrence":[139],"used":[140],"contraction.":[143],"method":[145],"generalises":[146],"previous":[147],"analyses":[148],"applied":[150,185],"only":[151,186],"graphs.":[154],"As":[155],"application":[158],"our":[160],"techniques,":[161],"we":[162],"consider":[163],"random":[165],"graph":[166],"G":[167],"(n,":[168],"d/n)":[169],",":[170,213],"where":[171],"previously":[173],"known":[174],"run":[176],"n":[179],"O":[180],"(log":[181],"d":[182,189,212],")":[183],"or":[184],".":[190],"We":[191],"refine":[192],"algorithmic":[194],"significantly,":[196],"develop":[198],"fast":[199],"nearly":[200],"linear":[201],"based":[203],"dynamics":[206],"apply":[208],"all":[210],"regime.":[217]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
