{"title":"快速混合","authors":"P. Winkler","doi":"10.1109/CCC.2002.1004347","DOIUrl":null,"url":null,"abstract":"Summary form only given. In the past decade many proofs of tractability, have involved showing that some Markov chain \"mixes rapidly\". We do a fast tour of the highlights of Markov chain mixing, with a view toward answering, or at least addressing, the following questions: What is rapid mixing? How do you prove it, and why would you want to? Does it really have anything to do with computational complexity? And, most disturbing: is there any truth to the rumor that complexity and rapid mixing are related to phase transitions in statistical physics?.","PeriodicalId":193513,"journal":{"name":"Proceedings 17th IEEE Annual Conference on Computational Complexity","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Rapid mixing\",\"authors\":\"P. Winkler\",\"doi\":\"10.1109/CCC.2002.1004347\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. In the past decade many proofs of tractability, have involved showing that some Markov chain \\\"mixes rapidly\\\". We do a fast tour of the highlights of Markov chain mixing, with a view toward answering, or at least addressing, the following questions: What is rapid mixing? How do you prove it, and why would you want to? Does it really have anything to do with computational complexity? And, most disturbing: is there any truth to the rumor that complexity and rapid mixing are related to phase transitions in statistical physics?.\",\"PeriodicalId\":193513,\"journal\":{\"name\":\"Proceedings 17th IEEE Annual Conference on Computational Complexity\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 17th IEEE Annual Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2002.1004347\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 17th IEEE Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2002.1004347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Summary form only given. In the past decade many proofs of tractability, have involved showing that some Markov chain "mixes rapidly". We do a fast tour of the highlights of Markov chain mixing, with a view toward answering, or at least addressing, the following questions: What is rapid mixing? How do you prove it, and why would you want to? Does it really have anything to do with computational complexity? And, most disturbing: is there any truth to the rumor that complexity and rapid mixing are related to phase transitions in statistical physics?.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
