改进了采样着色的边界

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI:10.1109/SFFCS.1999.814577

Eric Vigoda

{"title":"改进了采样着色的边界","authors":"Eric Vigoda","doi":"10.1109/SFFCS.1999.814577","DOIUrl":null,"url":null,"abstract":"We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree /spl Delta/. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 /spl Delta/.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"240","resultStr":"{\"title\":\"Improved bounds for sampling colorings\",\"authors\":\"Eric Vigoda\",\"doi\":\"10.1109/SFFCS.1999.814577\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree /spl Delta/. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 /spl Delta/.\",\"PeriodicalId\":385047,\"journal\":{\"name\":\"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"240\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFFCS.1999.814577\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFFCS.1999.814577","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 240

摘要

我们考虑了从最大度/spl Delta/的图的k色集合中均匀抽样的问题。我们的主要结果是设计的马尔可夫链在O(nk log n)时间内收敛到期望的分布，当k>11/6 /spl δ /。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Improved bounds for sampling colorings

We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree /spl Delta/. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 /spl Delta/.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)

自引率

0.00%

发文量