{"id":"https://openalex.org/W7166863418","doi":"https://doi.org/10.4230/lipics.icalp.2026.76","title":"Tight Bounds for Sampling q-Colorings via Coupling from the Past","display_name":"Tight Bounds for Sampling q-Colorings via Coupling from the Past","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166863418","doi":"https://doi.org/10.4230/lipics.icalp.2026.76"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26465","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.76","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.76/LIPIcs.ICALP.2026.76.pdf","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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.76/LIPIcs.ICALP.2026.76.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090056556","display_name":"Tianxing Ding","orcid":null},"institutions":[{"id":"https://openalex.org/I13227775","display_name":"Cornerstone University","ror":"https://ror.org/01nfeyj87","country_code":"US","type":"education","lineage":["https://openalex.org/I13227775"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ding, Tianxing","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China"],"raw_orcid":"https://orcid.org/0009-0003-6418-2341","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China","institution_ids":["https://openalex.org/I13227775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024428102","display_name":"H.W. Liu","orcid":"https://orcid.org/0000-0002-6461-3389"},"institutions":[{"id":"https://openalex.org/I13227775","display_name":"Cornerstone University","ror":"https://ror.org/01nfeyj87","country_code":"US","type":"education","lineage":["https://openalex.org/I13227775"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liu, Hongyang","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China"],"raw_orcid":"https://orcid.org/0000-0002-6461-3389","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China","institution_ids":["https://openalex.org/I13227775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101513638","display_name":"Yitong Yin","orcid":"https://orcid.org/0000-0001-9204-7794"},"institutions":[{"id":"https://openalex.org/I13227775","display_name":"Cornerstone University","ror":"https://ror.org/01nfeyj87","country_code":"US","type":"education","lineage":["https://openalex.org/I13227775"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin, Yitong","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China"],"raw_orcid":"https://orcid.org/0000-0001-9204-7794","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China","institution_ids":["https://openalex.org/I13227775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5139802235","display_name":"Can Zhou","orcid":"https://orcid.org/0009-0000-8564-7361"},"institutions":[{"id":"https://openalex.org/I13227775","display_name":"Cornerstone University","ror":"https://ror.org/01nfeyj87","country_code":"US","type":"education","lineage":["https://openalex.org/I13227775"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhou, Can","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China"],"raw_orcid":"https://orcid.org/0009-0000-8564-7361","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, China","institution_ids":["https://openalex.org/I13227775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I13227775"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.81250478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8784999847412109,"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.8784999847412109,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04520000144839287,"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/T11716","display_name":"Random Matrices and Applications","score":0.015599999576807022,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.7039999961853027},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5328999757766724},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5030999779701233},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.41339999437332153},{"id":"https://openalex.org/keywords/coupling","display_name":"Coupling (piping)","score":0.4106999933719635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40549999475479126},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.36899998784065247}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7039999961853027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6741999983787537},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5328999757766724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5102999806404114},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5030999779701233},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4684000015258789},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.41339999437332153},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.4106999933719635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40549999475479126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36970001459121704},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.321399986743927},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26465","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.76","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.76/LIPIcs.ICALP.2026.76.pdf","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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.76","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.76","pdf_url":null,"source":null,"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"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26465","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.76","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.76/LIPIcs.ICALP.2026.76.pdf","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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166863418.pdf","grobid_xml":"https://content.openalex.org/works/W7166863418.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Coupling":[1],"from":[2],"the":[3,26,43,82,104],"Past":[4],"(CFTP)":[5],"paradigm":[6],"is":[7],"a":[8,34,95],"canonical":[9],"method":[10],"for":[11,37,86,90],"perfect":[12],"sampling.":[13],"For":[14],"uniform":[15],"sampling":[16],"of":[17,29,134],"proper":[18],"q-colorings":[19],"in":[20],"graphs":[21],"with":[22],"maximum":[23],"degree":[24],"\u0394,":[25],"bounding":[27,135],"chains":[28],"[Huber,":[30],"STOC":[31,61,75],"'98]":[32],"provide":[33],"systematic":[35],"framework":[36],"efficiently":[38],"implementing":[39],"CFTP":[40,88,117],"algorithms":[41,89,102],"within":[42],"classical":[44],"regime":[45],"q":[46,54,65,109,125],"\u2265":[47,66,110,126],"(1+o(1))\u0394\u00b2.":[48],"This":[49],"was":[50],"subsequently":[51],"improved":[52],"to":[53,64],">":[55],"3\u0394":[56],"by":[57,70],"[Bhandari":[58],"and":[59,63,73,112],"Chakraborty,":[60],"'20]":[62],"(8/3":[67],"+":[68,128],"o(1))\u0394":[69,129],"[Jain,":[71],"Sah,":[72],"Sawhney,":[74],"'21].":[76],"In":[77],"this":[78,121],"work,":[79],"we":[80,113],"establish":[81],"asymptotically":[83,122],"tight":[84],"threshold":[85,124],"bounding-chain-based":[87],"graph":[91],"colorings.":[92],"We":[93],"prove":[94],"lower":[96],"bound":[97],"showing":[98],"that":[99,119],"all":[100],"such":[101],"satisfying":[103],"standard":[105],"contraction":[106],"property":[107],"require":[108],"2.5\u0394,":[111],"present":[114],"an":[115,131],"efficient":[116],"algorithm":[118],"achieves":[120],"optimal":[123,132],"(2.5":[127],"via":[130],"design":[133],"chains.":[136]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}